Characterizations of optimal solution sets for DC optimization problems in locally convex spaces

MaRDI QIDQ5048264zbMATH OpenFDO

Authors Liping Tian, Dongping Ye, D. H. Fang

Publication date 15 November 2022

Full work available at URL http://yokohamapublishers.jp/online2/opjnca/vol22/p587.html

zbMATH Keywords

optimal solution setDC programmingLagrangian-type functionmixed-type duality

Mathematics Subject Classification ID

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

Recommendations

• The optimal solution set of non-convex quadratic minimization problem over a D.C. set
• Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
• The strong duality for DC optimization problems with composite convex functions
• Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
• Optimality conditions and duality for DC programming in locally convex spaces

Cited in

(3)

• Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
• Characterizing robust -optimal solution sets for uncertain convex optimization problems
• The optimal solution set of non-convex quadratic minimization problem over a D.C. set

This page was built for publication: Characterizations of optimal solution sets 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 Q5048264)