Stable zero Lagrange duality for DC conic programming
From MaRDI portal
Publication:1952895
DOI10.1155/2012/606457zbMath1271.90063OpenAlexW2018798387WikidataQ58906227 ScholiaQ58906227MaRDI QIDQ1952895
Publication date: 3 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/606457
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (1)
Cites Work
- Unnamed Item
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- On a zero duality gap result in extended monotropic programming
- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- 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
- Some convex programs without a duality gap
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
- Zero duality gaps in infinite-dimensional programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Qualification and optimality conditions for dc programs with infinite constraints
- On strong and total Lagrange duality for convex optimization problems
- The strong conical hull intersection property for convex programming
- An alternative formulation for a new closed cone constraint qualification
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex 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
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- A Global Approach to Nonlinearly Constrained Best Approximation
This page was built for publication: Stable zero Lagrange duality for DC conic programming
