New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
From MaRDI portal
Publication:929661
DOI10.1016/j.na.2007.05.021zbMath1142.49015OpenAlexW2092061595MaRDI QIDQ929661
Radu Ioan Boţ, Sorin-Mihai Grad, Gert Wanka
Publication date: 18 June 2008
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2007.05.021
conjugate functionsconstraint qualificationsstable strong duality(Locally) Farkas-Minkowski conditionFenchel-Lagrange dual
Convex programming (90C25) Regularity of solutions in optimal control (49N60) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)
Related Items
Duality theorems for separable convex programming without qualifications ⋮ Farkas-type results for vector-valued functions with applications ⋮ Some characterizations of robust optimal solutions for uncertain fractional optimization and applications ⋮ On several types of basic constraint qualifications via coderivatives for generalized equations ⋮ Some characterizations of robust optimal solutions for uncertain convex optimization problems ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint ⋮ Weighted robust optimality of convex optimization problems with data uncertainty ⋮ Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ Necessary and sufficient constraint qualification for surrogate duality ⋮ On set containment characterization and constraint qualification for quasiconvex programming ⋮ Extended Farkas lemma and strong duality for composite optimization problems with DC functions ⋮ Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme ⋮ Stable zero Lagrange duality for DC conic programming ⋮ Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems ⋮ Attouch-Théra duality revisited: Paramonotonicity and operator splitting ⋮ A complete characterization of strong duality in nonconvex optimization with a single constraint ⋮ Farkas-type results for constrained fractional programming with DC functions ⋮ Robust duality in parametric convex optimization ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems ⋮ Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming ⋮ On constraint qualifications of a nonconvex inequality ⋮ On biconjugates of infimal functions ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ On robust duality for fractional programming with uncertainty data ⋮ Stable strong Fenchel and Lagrange duality for evenly convex optimization problems ⋮ Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming ⋮ Optimization of boundary value problems for higher order differential inclusions and duality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Farkas-Minkowski systems in semi-infinite programming
- Semi-continuous mappings in general topology
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- On strong and total Lagrange duality for convex optimization problems
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- An alternative formulation for a new closed cone constraint qualification
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Characterizations of the Strong Basic Constraint Qualifications
- The Hahn–Banach–Lagrange theorem
This page was built for publication: New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
