Extended Farkas lemma and strong duality for composite optimization problems with DC functions
From MaRDI portal
Publication:2970390
DOI10.1080/02331934.2016.1266628zbMath1406.90128OpenAlexW2561714685WikidataQ125029945 ScholiaQ125029945MaRDI QIDQ2970390
Publication date: 30 March 2017
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1266628
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)
Related Items (9)
Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces ⋮ Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems ⋮ Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Duality for minimization of the difference of two \(\Phi_c\)-convex functions ⋮ Extended Farkas's lemmas and strong dualities for conic programming involving composite functions ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs ⋮ A forward-backward algorithm for the DC programming in Hilbert spaces
Cites Work
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Total Lagrange duality for DC infinite optimization problems
- Duality and Farkas-type results for DC fractional programming with DC constraints
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Some new Farkas-type results for inequality systems with DC functions
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- A note on subdifferentials of convex composite functionals
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- The stable Farkas lemma for composite convex functions in infinite dimensional spaces
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- A closedness condition and its applications to DC programs with convex constraints
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Generalized Moreau–Rockafellar results for composed convex functions
- New Farkas-type constraint qualifications in convex infinite programming
This page was built for publication: Extended Farkas lemma and strong duality for composite optimization problems with DC functions
