Sciweavers

560 search results - page 46 / 112
» Level-set methods for convex optimization
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 3 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
ICCAD
1998
IEEE
130views Hardware» more  ICCAD 1998»
15 years 7 months ago
GPCAD: a tool for CMOS op-amp synthesis
We present a method for optimizing and automating component and transistor sizing for CMOS operational amplifiers. We observe that a wide variety of performance measures can be fo...
Maria del Mar Hershenson, Stephen P. Boyd, Thomas ...
116
Voted
CVPR
2008
IEEE
16 years 5 months ago
Globally optimal shape-based tracking in real-time
Most algorithms for real-time tracking of deformable shapes provide sub-optimal solutions for a suitable energy minimization task: The search space is typically considered too lar...
Thomas Schoenemann, Daniel Cremers
ATAL
2010
Springer
15 years 4 months ago
Distributed multiagent learning with a broadcast adaptive subgradient method
Many applications in multiagent learning are essentially convex optimization problems in which agents have only limited communication and partial information about the function be...
Renato L. G. Cavalcante, Alex Rogers, Nicholas R. ...
133
Voted
SIAMJO
2002
92views more  SIAMJO 2002»
15 years 3 months ago
Generalized Bundle Methods
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
Antonio Frangioni