17 search results - page 3 / 4 » The Newton Bracketing method for the minimization of convex ... |
SIAMJO
2010
13 years 16 days ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
TSP
2008
13 years 5 months ago
2008
We consider the problem of estimating and detecting sparse signals over a large area of an image or other medium. We introduce a novel cost function that captures the tradeoff bet...
CVPR
2010
IEEE
13 years 6 months ago
2010
IEEE
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...
ISPD
1997
ACM
13 years 10 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
SIAMIS
2008
13 years 5 months ago
2008
We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant val...