Sciweavers

1118 search results - page 56 / 224
» Convex Optimization
Sort
View
IVC
2007
114views more  IVC 2007»
15 years 4 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
SIAMMAX
2011
92views more  SIAMMAX 2011»
14 years 7 months ago
A Condition for Convexity of a Product of Positive Definite Quadratic Forms
A sufficient condition for the convexity of a finite product of positive definite quadratic forms is given in terms of the condition numbers of the underlying matrices. When only...
Minghua Lin, Gord Sinnamon
MP
2006
87views more  MP 2006»
15 years 4 months ago
A Robust Optimization Approach to Dynamic Pricing and Inventory Control with no Backorders
In this paper, we present a robust optimization formulation for dealing with demand uncertainty in a dynamic pricing and inventory control problem for a make-to-stock manufacturing...
Elodie Adida, Georgia Perakis
MP
2011
14 years 7 months ago
Strong KKT conditions and weak sharp solutions in convex-composite optimization
Using variational analysis techniques, we study convex-composite optimization problems. In connection with such a problem, we introduce several new notions as variances of the clas...
Xi Yin Zheng, Kung Fu Ng
CORR
2011
Springer
194views Education» more  CORR 2011»
14 years 11 months ago
Approachability of Convex Sets in Games with Partial Monitoring
We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e. where players do not observe their opponents’ mo...
Vianney Perchet