On strong and total Lagrange duality for convex optimization problems
From MaRDI portal
The authors present some necessary and sufficient conditions, which completely characterize the strong and total Lagrange duality, respectively, for convex optimization problems in separated locally convex spaces. The authors also prove similar statements for the problems obtained by perturbing the objective functions of the primal problems by arbitrary linear functionals. In the particular case, to deal with convex optimization problems having infinitely many convex inequalities as constraints, the conditions considered in this paper become the so-called Farkas-Minkowski and locally Farkas-Minkowski conditions for systems of convex inequalities used in the literature. In some situations, the locally Farkas-Minkowski condition turns out to be equivalent to the basic constraint qualification (BCQ) used in the literature. See [\textit{J.-B. Hiriart-Urruty} and \textit{C. Lemarechal}, Convex analysis and minimization algorithms. Part 1: Fundamentals. Grundlehren der Mathematischen Wissenschaften. 305. (Berlin): Springer- Verlag. (1993; Zbl 0795.49001)] and \textit{H. Hu} [Math. Oper. Res., 30, No. 4, 956--965 (2005; Zbl 1278.90310)]. Different results are also rediscovered as special cases and some of them are improved in their original context.
Recommendations
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Strong and total Lagrange dualities for quasiconvex programming
- scientific article; zbMATH DE number 7294847
- New regularity conditions for Lagrange and Fenchel-Lagrange duality in infinite dimensional spaces
- Strong and total Fenchel dualities for robust convex optimization problems
Cites work
- A dual condition for the convex subdifferential sum formula with applications
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- An alternative formulation for a new closed cone constraint qualification
- Characterizations of the Strong Basic Constraint Qualifications
- Constraint qualifications for semi-infinite systems of convex inequalities
- Farkas-Minkowski systems in semi-infinite programming
- From linear to convex systems: consistency, Farkas' lemma and applications
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 734672 (Why is no real title available?)
- scientific article; zbMATH DE number 2156769 (Why is no real title available?)
- Locally Farkas-Minkowski systems in convex semi-infinite programming
- Lower semicontinuous regularization for vector-valued mappings
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- New Farkas-type constraint qualifications in convex infinite programming
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- Semi-continuous mappings in general topology
Cited in
(52)- Duality gap of the conic convex constrained optimization problems in normed spaces
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- Convex and convex-like optimization over a range inclusion problem and first applications
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
- Stable zero Lagrange duality for DC conic programming
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
- On strong duality in linear copositive programming
- Weighted robust optimality of convex optimization problems with data uncertainty
- Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- Strong and total Lagrange dualities for quasiconvex programming
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- The stable duality of DC programs for composite convex functions
- Duality theorems for separable convex programming without qualifications
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- Sequential optimality conditions for composed convex optimization problems
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints
- Optimality conditions for non-smooth semi-infinite programming
- On biconjugates of infimal functions
- Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
- Generalized weak sharp minima and the existence of strong Lagrangian multipliers in conic convex optimization
- scientific article; zbMATH DE number 5944598 (Why is no real title available?)
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Generalized Moreau–Rockafellar results for composed convex functions
- Strong Core Theorems with Nonconvex Preferences
- Convergence of Lagrange Multipliers and Dual Variables for Convex Optimization Problems
- 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
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- Hadamard and Strong Well-Posedness for Convex Programs
- Attouch-Théra duality revisited: Paramonotonicity and operator splitting
- Some characterizations of duality for DC optimization with composite functions
- Farkas-type results for constrained fractional programming with DC functions
- Robust duality in parametric convex optimization
- Strong and total Lagrange dualities for quasiconvex programming
- scientific article; zbMATH DE number 7294847 (Why is no real title available?)
- Optimality conditions and total dualities for conic programming involving composite function
- On Lagrange Duality for Several Classes of Nonconvex Optimization Problems
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- On set containment characterization and constraint qualification for quasiconvex programming
- Optimality conditions and total Lagrange dualities for evenly convex optimization problems
- Lagrange duality on DC evenly convex optimization problems via a generalized conjugation scheme
- Optimality conditions and Lagrange dualities for optimization problems involving _c-convex functions
- On constraint qualifications of a nonconvex inequality
- On robust duality for fractional programming with uncertainty data
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
This page was built for publication: On strong and total Lagrange duality for convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2473844)
