Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
From MaRDI portal
Publication:413608
DOI10.1016/j.na.2012.01.023zbMath1266.90147OpenAlexW2050047470MaRDI QIDQ413608
Xiao Qi Yang, Chong Li, Dong Hui Fang
Publication date: 7 May 2012
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2012.01.023
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (5)
A subgradient-based convex approximations method for DC programming and its applications ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ A note on optimality conditions for DC programs involving composite functions ⋮ On constraint qualifications of a nonconvex inequality ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality for multiobjective optimization problems with convex objective functions and D.C. 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
- 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
- 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
- On strong and total Lagrange duality for convex optimization problems
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- The strong conical hull intersection property for convex programming
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Necessary and sufficient conditions for stable conjugate duality
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- Duality in Vector Optimization
- 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
- 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
- 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
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- A simple closure condition for the normal cone intersection formula
- Level Sets and Continuity of Conjugate Convex Functions
This page was built for publication: Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
