✦ LIBER ✦

New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs

✍ Scribed by Jeyakumar, V.; Lee, G. M.; Dinh, N.

Book ID: 118204253
Publisher: Society for Industrial and Applied Mathematics
Year: 2003
Tongue: English
Weight: 182 KB
Volume: 14
Category: Article
ISSN: 1052-6234
DOI: 10.1137/s1052623402417699

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.

Characterization of optimality in convex

Characterization of optimality in convex programming without a constraint qualification

✍ A. Ben-Tal; A. Ben-Israel; S. Zlobec 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 822 KB

Lagrange Multiplier Conditions Character

Lagrange Multiplier Conditions Characterizing the Optimal Solution Sets of Cone-Constrained Convex Programs

✍ V. Jeyakumar; G. M. Lee; N. Dinh 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 127 KB

A Practical Optimality Condition Without

A Practical Optimality Condition Without Constraint Qualifications for Nonlinear Programming

✍ J.M. Martínez; B.F. Svaiter 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 107 KB

Lagrange multiplier necessary conditions

Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma

✍ V. Jeyakumar; S. Srisatkunarajah 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 156 KB