Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces

DOI10.1137/100789749zbMATH Open1236.90140OpenAlexW4233192371MaRDI QIDQ3105772FDOQ3105772

Authors: C. Li, D. H. Fang, Xiao Qi Yang 

Publication date: 9 January 2012

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/6098

Recommendations

• 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
• Stable and total Fenchel duality for convex optimization problems in locally convex spaces
• Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
• Optimality conditions and duality for DC programming in locally convex spaces
• The stable duality of DC programs for composite convex functions
• Stable and total Fenchel duality for composed convex optimization problems
• Farkas-type results and duality for DC programs with convex constraints
• Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions

zbMATH Keywords

weak dualityDC functionsDC optimization problemsstable Fenchel dualitystable total dualitystrong Fenchel duality

Mathematics Subject Classification ID

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

Cited In (33)

• Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces
• Approximate optimality conditions for composite convex optimization problems
• A note on optimality conditions for DC programs involving composite functions
• Title not available (Why is that?)
• A Comparison of Some Recent Regularity Conditions for Fenchel Duality
• A forward-backward algorithm for the DC programming in Hilbert spaces
• Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces
• Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
• The stable duality of DC programs for composite convex functions
• Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
• The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces
• Strong duality and optimality conditions for generalized equilibrium problems
• Optimality conditions for composite DC infinite programming problems
• Stable and total Fenchel duality for convex optimization problems in locally convex spaces
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
• New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions
• Stable and total Fenchel dualities for DC composite optimization problems in locally convex spaces
• Characterizations of optimal solution sets for DC optimization problems in locally convex spaces
• Title not available (Why is that?)
• Characterizations of robust solution set of convex programs with uncertain data
• Some characterizations of duality for DC optimization with composite functions
• Farkas-type results for constrained fractional programming with DC functions
• Total Lagrange duality for DC infinite optimization problems
• On robust duality for fractional programming with uncertainty data
• Sequential optimality conditions for fractional optimization with applications to vector optimization
• Stable zero Lagrange duality for DC conic programming
• Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems
• Optimality conditions and duality for DC programming in locally convex spaces
• Extended Farkas lemma and strong duality for composite optimization problems with DC functions
• Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty
• Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming

This page was built for publication: Stable and Total 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 Q3105772)