On strong and total Lagrange duality for convex optimization problems
From MaRDI portal
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
- 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?)
- 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
- 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
(49)- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- Duality gap of the conic convex constrained optimization problems in normed spaces
- scientific article; zbMATH DE number 5944598 (Why is no real title available?)
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- On set containment characterization and constraint qualification for quasiconvex programming
- Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
- Fenchel-Lagrange duality for DC infinite programs with inequality constraints
- Sequential optimality conditions for composed convex optimization problems
- The stable duality of DC programs for composite convex functions
- On biconjugates of infimal functions
- Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
- Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs
- On constraint qualifications of a nonconvex inequality
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Duality theorems for separable convex programming without qualifications
- Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- Attouch-Théra duality revisited: Paramonotonicity and operator splitting
- scientific article; zbMATH DE number 7294847 (Why is no real title available?)
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- On strong duality in linear copositive programming
- Characterizations of \(\varepsilon\)-duality gap statements for constrained optimization problems
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Hadamard and Strong Well-Posedness for Convex Programs
- Farkas-type results for constrained fractional programming with DC functions
- Robust duality in parametric convex optimization
- Some characterizations of duality for DC optimization with composite functions
- On robust duality for fractional programming with uncertainty data
- Optimality conditions and total dualities for conic programming involving composite function
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Generalized weak sharp minima and the existence of strong Lagrangian multipliers in conic convex optimization
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- Generalized Moreau–Rockafellar results for composed convex functions
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- On Lagrange Duality for Several Classes of Nonconvex Optimization Problems
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- Strong Core Theorems with Nonconvex Preferences
- Stable zero Lagrange duality for DC conic programming
- Convex and convex-like optimization over a range inclusion problem and first applications
- Optimality conditions for non-smooth semi-infinite programming
- Strong and total Lagrange dualities for quasiconvex programming
- Convergence of Lagrange Multipliers and Dual Variables for Convex Optimization Problems
- Weighted robust optimality of convex optimization problems with data uncertainty
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- Strong and total Lagrange dualities for quasiconvex programming
- Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
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)
