๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Constraint Qualifications Characterizing Lagrangian Duality in Convex Optimization

โœ Scribed by V. Jeyakumar

Publisher
Springer
Year
2007
Tongue
English
Weight
299 KB
Volume
136
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Constraint qualifications for optimality
Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
โœ D.H. Fang; C. Li; K.F. Ng ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 437 KB

For an inequality system defined by an infinite family of proper convex functions (not necessarily lower semicontinuous), we introduce some new notions of constraint qualifications. Under the new constraint qualifications, we provide necessary and/or sufficient conditions for the KKT rules to hold.