✦ LIBER ✦

Fenchel-Lagrange Duality Versus Geometric Duality in Convex Optimization

✍ Scribed by R. I. Boţ; S. M. Grad; G. Wanka

Publisher: Springer
Year: 2006
Tongue: English
Weight: 291 KB
Volume: 129
Category: Article
ISSN: 0022-3239
DOI: 10.1007/s10957-006-9047-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalization of Fenchel's duality theo

Generalization of Fenchel's duality theorem for convex vector optimization

✍ Christian Gros 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 768 KB

Fenchel's duality theorem in generalized

Fenchel's duality theorem in generalized geometric programming

✍ E. L. Peterson 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 302 KB

Fenchel-Rockafellar type duality for a n

Fenchel-Rockafellar type duality for a non-convex non-differential optimization problem

✍ P Kanniappan 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Universal duality in conic convex optimi

Universal duality in conic convex optimization

✍ Simon P. Schurr; André L. Tits; Dianne P. O'Leary 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 194 KB

Geometric consideration of duality in ve

Geometric consideration of duality in vector optimization

✍ H. Nakayama 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 992 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.