560 search results - page 30 / 112 » Level-set methods for convex optimization |
212
Voted
SIAMIS
2011
14 years 10 months ago
2011
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
124
click to vote
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
224
Voted
DAGM
2006
Springer
15 years 7 months ago
2006
Springer
We present a new approach to integrated motion estimation and segmentation by combining methods from discrete and continuous optimization. The velocity of each of a set of regions ...
125
Voted
ISPD
1998
ACM
15 years 7 months ago
1998
ACM
This paper proposes a placement method for a mixed set of hard, soft, and pre-placed modules, based on a placement topology representation called sequence-pair. Under one sequence...
112
Voted
FOCM
2002
15 years 3 months ago
2002
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...