The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
From MaRDI portal
Publication:2438323
DOI10.3934/naco.2014.4.9zbMath1292.90241MaRDI QIDQ2438323
Publication date: 11 March 2014
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2014.4.9
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
Some characterizations of duality for DC optimization with composite functions, New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions, Optimality conditions and total dualities for conic programming involving composite function, Stable and total Fenchel duality for composed convex optimization problems, Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme, Extended Farkas's lemmas and strong dualities for conic programming involving composite functions, The stable duality of DC programs for composite convex functions, Fenchel-Lagrange duality for DC infinite programs with inequality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Duality in nonconvex optimization
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- On strong and total Lagrange duality for convex optimization problems
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- An alternative formulation for a new closed cone constraint qualification
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
- A closedness condition and its applications to DC programs with convex constraints
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Generalized Moreau–Rockafellar results for composed convex functions
- New Farkas-type constraint qualifications in convex infinite programming
- Convex analysis and global optimization
