116 search results - page 5 / 24 » Separable convex optimization problems with linear ascending... |
CORR
2011
Springer
13 years 25 days ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
ECCV
2004
Springer
14 years 11 months ago
2004
Springer
When we take a picture through transparent glass the image we obtain is often a linear superposition of two images: the image of the scene beyond the glass plus the image of the sc...
ICPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Geometric methods are very intuitive and provide a theoretically solid viewpoint to many optimization problems. SVM is a typical optimization task that has attracted a lot of atte...
MP
2007
13 years 8 months ago
2007
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
WIOPT
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...