𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New Constraint Qualification and Conjugate Duality for Composed Convex Optimization Problems

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

Publisher
Springer
Year
2007
Tongue
English
Weight
376 KB
Volume
135
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.

Generalized Constraint Qualifications an
Generalized Constraint Qualifications and Optimality Conditions for Set-Valued Optimization Problems
✍ Huang Yong-Wei 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 106 KB

In this paper we discuss the connections of four generalized constraint qualifications for set-valued vector optimization problems with constraints. Then some K-T type necessary and sufficient optimality conditions are derived, in terms of the contingent epiderivatives.

A new constraint qualification for the f
A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
✍ Radu Ioan Boţ; Sorin-Mihai Grad; Gert Wanka 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB 👁 1 views

## Abstract In this paper we work in separated locally convex spaces where we give equivalent statements for the formulae of the conjugate function of the sum of a convex lower‐semicontinuous function and the precomposition of another convex lower‐semicontinuous function which is also __K__ ‐increa