Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
From MaRDI portal
Publication:1743534
DOI10.1007/s10957-018-1219-3zbMath1390.90440OpenAlexW2783265466WikidataQ124818277 ScholiaQ124818277MaRDI QIDQ1743534
Publication date: 13 April 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1219-3
Nonconvex programming, global optimization (90C26) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Duality theory (optimization) (49N15)
Related Items (5)
New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems ⋮ Duality for minimization of the difference of two \(\Phi_c\)-convex functions ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ Min-sup-type zero duality gap properties for DC composite optimization problem ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
Cites Work
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Functional inequalities and theorems of the alternative involving composite functions
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- 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
- Duality gap of the conic convex constrained optimization problems in normed spaces
- On minima of the difference of functions
- Approximate optimality conditions for composite convex optimization problems
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- DC programming: overview.
- Farkas-type results for vector-valued functions with applications
- Qualification and optimality conditions for dc programs with infinite constraints
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- New constraint qualification and conjugate duality for composed convex optimization problems
- On strong and total Lagrange duality for convex optimization problems
- Extended Farkas lemma and strong duality for composite optimization problems with DC functions
- On Zero Duality Gap and the Farkas Lemma for Conic Programming
- From the Farkas Lemma to the Hahn--Banach Theorem
- 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
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Generalized Moreau–Rockafellar results for composed convex functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Extended Farkas's lemmas and strong dualities for conic programming involving composite functions
