Conditions for zero duality gap in convex programming
From MaRDI portal
Publication:5410417
zbMath1301.49035arXiv1211.4953MaRDI QIDQ5410417
Jonathan M. Borwein, Liangjin Yao, Regina Sandra Burachik
Publication date: 16 April 2014
Full work available at URL: https://arxiv.org/abs/1211.4953
convex programmingzero duality gap\(\varepsilon\)-subdifferentialnormal cone operatorFenchel conjugateFenchel duality theorem\(\inf\)-convolutionBertsekas constraint qualification
Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Duality theory (optimization) (49N15)
Related Items (10)
Unnamed Item ⋮ Zero duality gap conditions via abstract convexity ⋮ Convexity and closedness in stable robust duality ⋮ Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap ⋮ Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems ⋮ Applications of convex analysis within mathematics ⋮ \(\varepsilon \)-subdifferential as an enlargement of the subdifferential ⋮ Revisiting some rules of convex analysis ⋮ On epsilon-stability in optimization ⋮ On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization
This page was built for publication: Conditions for zero duality gap in convex programming
