560 search results - page 40 / 112 » Level-set methods for convex optimization |
123
Voted
NIPS
2008
15 years 4 months ago
2008
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...
124
Voted
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
167
Voted
TSP
2010
14 years 10 months ago
2010
We present two simple methods for recovering sparse signals from a series of noisy observations. The theory of compressed sensing (CS) requires solving a convex constrained minimiz...
106
click to vote
MP
2002
15 years 3 months ago
2002
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
119
Voted
SMI
2007
IEEE
15 years 9 months ago
2007
IEEE
We present two complementary methods for automatically improving mesh parameterizations and demonstrate that they provide a very desirable combination of efficiency and quality. ...