Total Lagrange duality for DC infinite optimization problems
From MaRDI portal
Publication:401875
DOI10.1186/1687-1812-2013-269zbMath1295.90053OpenAlexW2148365796WikidataQ59301999 ScholiaQ59301999MaRDI QIDQ401875
Publication date: 27 August 2014
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1687-1812-2013-269
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (4)
Extended Farkas lemma and strong duality for composite optimization problems with DC functions ⋮ Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems ⋮ Optimality conditions and total dualities for conic programming involving composite function ⋮ Min-sup-type zero duality gap properties for DC composite optimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Constructing a perfect duality in infinite programming
- Duality in nonconvex optimization
- Duality in D. C. programming: The case of several D. C. constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- DC programming: overview.
- Qualification and optimality conditions for dc programs with infinite constraints
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
- 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
- Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
- On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
- New Farkas-type constraint qualifications in convex infinite programming
- Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces
This page was built for publication: Total Lagrange duality for DC infinite optimization problems
