225 search results - page 3 / 45 » Approximating Parameterized Convex Optimization Problems |
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...
CVPR
2012
IEEE
12 years 4 days 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...
SIAMJO
2011
13 years 4 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
NIPS
2001
13 years 11 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
AAECC
2007
Springer
13 years 9 months ago
2007
Springer
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...