Sciweavers

155 search results - page 1 / 31
» Minimization of convex functionals over frame operators
Sort
View
ADCM
2010
89views more  ADCM 2010»
13 years 5 months ago
Minimization of convex functionals over frame operators
Abstract. We present results about minimization of convex functionals defined over a finite set of vectors in a finite dimensional Hilbert space, that extend several known results ...
Pedro Massey, Mariano Ruiz
PAMI
2011
13 years 5 days ago
Multiview Stereo and Silhouette Consistency via Convex Functionals over Convex Domains
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
Daniel Cremers, Kalin Kolev
WCE
2007
13 years 6 months ago
A Multidimensional Bisection Method for Minimizing Function over Simplex
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
A. N. Baushev, E. Y. Morozova
DATE
2009
IEEE
129views Hardware» more  DATE 2009»
14 years 4 hour ago
Energy minimization for real-time systems with non-convex and discrete operation modes
—We present an optimal methodology for dynamic voltage scheduling problem in the presence of realistic assumption such as leakage-power and intra-task overheads. Our contribution...
Foad Dabiri, Alireza Vahdatpour, Miodrag Potkonjak...
ORL
2011
12 years 11 months ago
Convex approximations to sparse PCA via Lagrangian duality
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
Ronny Luss, Marc Teboulle