393 search results - page 35 / 79 » Convex Programming Methods for Global Optimization |
PADL
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Mathematical programs (MPs) are a class of constrained optimization problems that include linear, mixed-integer, and disjunctive programs. Strategies for solving MPs rely...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
Many computer vision applications such as image filtering, segmentation and stereo-vision can be formulated as optimization problems.Whereas in previous decades continuousdomain, ...
ASPDAC
2007
ACM
13 years 11 months ago
2007
ACM
In this paper, we present a systematic synthesis methodology for fully integrated wideband low noise amplifiers that simultaneously optimizes impedance matching, noise figure, and ...
EMMCVPR
2011
Springer
12 years 7 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...
SIAMJO
2008
13 years 7 months ago
2008
For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC lin...