Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
From MaRDI portal
Publication:3105772
DOI10.1137/100789749zbMath1236.90140OpenAlexW4233192371MaRDI QIDQ3105772
Chong Li, Dong Hui 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
weak dualityDC functionsDC optimization problemsstable Fenchel dualitystable total dualitystrong Fenchel duality
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items (24)
The stable duality of DC programs for composite convex functions ⋮ Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces ⋮ Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization ⋮ Optimality conditions of quasi $(\alpha,\varepsilon)$-solutions and approximate mixed type duality for DC composite optimization problems ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ Total Lagrange duality for DC infinite optimization problems ⋮ Robust Farkas-Minkowski constraint qualification for convex inequality system under data uncertainty ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Extended Farkas lemma and strong duality for composite optimization problems with DC functions ⋮ Stable zero Lagrange duality for DC conic programming ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ A note on optimality conditions for DC programs involving composite functions ⋮ Farkas-type results for constrained fractional programming with DC functions ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ Sequential optimality conditions for fractional optimization with applications to vector optimization ⋮ Strong duality and optimality conditions for generalized equilibrium problems ⋮ On robust duality for fractional programming with uncertainty data ⋮ New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ A forward-backward algorithm for the DC programming in Hilbert 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
