225 search results - page 9 / 45 » Approximating Parameterized Convex Optimization Problems |
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
We introduce a linearly weighted variant of the total
variation for vector fields in order to formulate regularizers
for multi-class labeling problems with non-trivial interclass...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
EMMCVPR
2011
Springer
12 years 9 months ago
2011
Springer
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
CORR
2011
Springer
13 years 1 months 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...