560 search results - page 17 / 112 » Level-set methods for convex optimization |
134
click to vote
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
154
click to vote
JMLR
2012
13 years 4 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
132
click to vote
SIAMJO
2010
14 years 8 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
TSP
2008
15 years 1 months ago
2008
We consider the problem of estimating and detecting sparse signals over a large area of an image or other medium. We introduce a novel cost function that captures the tradeoff bet...
118
click to vote
SIAMJO
2000
15 years 1 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...