Sciweavers

135 search results - page 6 / 27
» Properties of tree convex constraints
Sort
View
MP
2007
76views more  MP 2007»
13 years 8 months ago
Universal duality in conic convex optimization
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
Simon P. Schurr, André L. Tits, Dianne P. O...
MMSP
2008
IEEE
245views Multimedia» more  MMSP 2008»
14 years 3 months ago
A convex programming approach for color stereo matching
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
Wided Miled, Béatrice Pesquet-Popescu, Jean...
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
14 years 1 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
ISPD
1999
ACM
112views Hardware» more  ISPD 1999»
14 years 28 days ago
Arbitrary convex and concave rectilinear block packing using sequence-pair
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
Kunihiro Fujiyoshi, Hiroshi Murata
MP
2002
195views more  MP 2002»
13 years 8 months ago
Nonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with part...
Roman A. Polyak