Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces

DOI10.1016/J.NA.2012.01.023MaRDI QIDQ413608zbMATH OpenOpenAlexFDO

Authors Xiao Qi Yang, C. Li, D. H. 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

zbMATH Keywords

locally convex spaceDC programmingFenchel duality

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Recommendations

• Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
• Optimality conditions and duality for DC programming in locally convex spaces
• Stable and total Fenchel dualities for DC composite optimization problems in locally convex spaces
• Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
• Characterizations of optimal solution sets for DC optimization problems in locally convex spaces
• New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
• Farkas-type results and duality for DC programs with convex constraints
• A closedness condition and its applications to DC programs with convex constraints
• Stable and total Fenchel duality for convex optimization problems in locally convex spaces
• Local and global optimality conditions for dc infinite optimization problems

Cites work

• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• scientific article; zbMATH DE number 3525695 (Why is no real title available?)
• scientific article; zbMATH DE number 1022519 (Why is no real title available?)
• scientific article; zbMATH DE number 1544057 (Why is no real title available?)
• scientific article; zbMATH DE number 887371 (Why is no real title available?)
• A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
• A closedness condition and its applications to DC programs with convex constraints
• A dual condition for the convex subdifferential sum formula with applications
• A simple closure condition for the normal cone intersection formula
• A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
• Complete characterizations of stable Farkas' lemma and cone-convex programming duality
• Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
• Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
• DC programming: overview.
• Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
• Duality in D. C. programming: The case of several D. C. constraints
• Duality in Vector Optimization
• Duality in nonconvex optimization
• Farkas-type results and duality for DC programs with convex constraints
• Level Sets and Continuity of Conjugate Convex Functions
• Necessary and sufficient conditions for stable conjugate duality
• Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
• On strong and total Lagrange duality for convex optimization problems
• Qualification and optimality conditions for dc programs with infinite constraints
• Regularity Conditions via Quasi-Relative Interior in Convex Programming
• Some new Farkas-type results for inequality systems with DC functions
• Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
• Stable and total Fenchel duality for convex optimization problems in locally convex spaces
• Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
• The strong conical hull intersection property for convex programming

Cited in

(11)

• Approximate optimality conditions for composite convex optimization problems
• A note on optimality conditions for DC programs involving composite functions
• A Comparison of Some Recent Regularity Conditions for Fenchel Duality
• A subgradient-based convex approximations method for DC programming and its applications
• On constraint qualifications of a nonconvex inequality
• Stable and total Fenchel duality for convex optimization problems in locally convex spaces
• Some new Farkas-type results for inequality systems with DC functions
• New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
• Optimality conditions and duality for DC programming in locally convex spaces
• 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

This page was built for publication: Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413608)