Zero duality gap for convex programs: a general result
Abstract: This article addresses a general criterion providing a zero duality gap for convex programs in the setting of the real locally convex spaces. The main theorem of our work is formulated only in terms of the constraints of the program, hence it holds true for any objective function fulfilling a very general qualification condition, implied for instance by standard qualification criteria of Moreau-Rockafellar or Attouch-Br ́ezis type. This result generalizes recent theorems by Champion, Ban & Song and Jeyakumar & Li.
Keywords: convex program, constrained optimization, qualification condition, Slater’s condition, penalty function, continuous convex sets, recession analysis.
Category 1: Convex and Nonsmooth Optimization (Convex Optimization )
Citation: unpublished: Aix-Marseille Universités, december 2011
Entry Submitted: 12/15/2011
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|