✦ LIBER ✦

Characterization of optimality in convex programming without a constraint qualification

✍ Scribed by A. Ben-Tal; A. Ben-Israel; S. Zlobec

Publisher: Springer
Year: 1976
Tongue: English
Weight: 822 KB
Volume: 20
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00933129

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple constraint qualification in con

A simple constraint qualification in convex programming

✍ X. Zhou; F. Sharifi Mokhtarian; S. Zlobec 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 578 KB

Constraint Qualifications Characterizing

Constraint Qualifications Characterizing Lagrangian Duality in Convex Optimization

✍ V. Jeyakumar 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 299 KB

On A characterization of optimality in c

On A characterization of optimality in convex programming

✍ A. Ben-Israel; A. Ben-Tal 📂 Article 📅 1976 🏛 Springer-Verlag 🌐 English ⚖ 340 KB

Convex Inequalities Without Constraint Q

Convex Inequalities Without Constraint Qualification nor Closedness Condition, and Their Applications in Optimization

✍ N. Dinh; M. A. Goberna; M. A. López; M. Volle 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 502 KB

New dual constraint qualifications chara

New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs

✍ V. Jeyakumar; G.Y. Li 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 323 KB

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.