478 search results - page 5 / 96 » Convexity minimizes pseudo-triangulations |
TCS
2011
13 years 1 months ago
2011
Using a combinatorial characterization of digital convexity based on words, one defines the language of convex words. The complement of this language forms an ideal whose minimal...
DAM
2008
13 years 7 months ago
2008
The Newton Bracketing method [9] for the minimization of convex functions f : Rn R is extended to affinely constrained convex minimization problems. The results are illustrated for...
ICIP
1998
IEEE
14 years 8 months ago
1998
IEEE
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
JMLR
2010
13 years 5 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...