Sciweavers

137 search results - page 13 / 28
» A Method for Classification of Convex Polygons
Sort
View
SIAMJO
2008
99views more  SIAMJO 2008»
13 years 7 months ago
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
Marco C. Campi, Simone Garatti
SIAMIS
2010
283views more  SIAMIS 2010»
13 years 2 months ago
A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Var...
Ernie Esser, Xiaoqun Zhang, Tony F. Chan
JMLR
2006
150views more  JMLR 2006»
13 years 7 months ago
Exact 1-Norm Support Vector Machines Via Unconstrained Convex Differentiable Minimization
Support vector machines utilizing the 1-norm, typically set up as linear programs (Mangasarian, 2000; Bradley and Mangasarian, 1998), are formulated here as a completely unconstra...
Olvi L. Mangasarian
SIAMIS
2008
93views more  SIAMIS 2008»
13 years 7 months ago
Convex Source Support and Its Application to Electric Impedance Tomography
The aim in electric impedance tomography is to recover the conductivity inside a physical body from boundary measurements of current and voltage. In many situations of practical im...
Martin Hanke, Nuutti Hyvönen, Stefanie Reussw...
CDC
2008
IEEE
107views Control Systems» more  CDC 2008»
14 years 2 months ago
Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
Michael P. Vitus, Steven Lake Waslander, Claire J....