𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming

✍ Scribed by D.H. Fang; C. Li; K.F. Ng

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
437 KB
Volume
73
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.

✦ Synopsis

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. Similarly, we provide characterizations for constrained minimization problems to have total Lagrangian dualities. Several known results in the conic programming problem are extended and improved.

πŸ“œ SIMILAR VOLUMES

Optimality conditions for convex semi-in
Optimality conditions for convex semi-infinite programming problems
✍ A. Ben-Tal; L. Kerzner; S. Zlobec πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 923 KB

## Abstract This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn‐Tucker theories

New regularity conditions for strong and
New regularity conditions for strong and total Fenchel–Lagrange duality in infinite dimensional spaces
✍ Radu Ioan BoΕ£; Sorin-Mihai Grad; Gert Wanka πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 354 KB

We give new regularity conditions for convex optimization problems in separated locally convex spaces. We completely characterize the stable strong and strong Fenchel-Lagrange duality. Then we give similar statements for the case when a solution of the primal problem is assumed as known, obtaining c