The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions

In this paper, by virtue of the epigraph technique, we construct a new kind of closedness-type constraint qualification, which is the sufficient and necessary condition to guarantee the strong duality between a cone constraint composite optimization problem and its dual problem holds. Under this closedness-type constraint qualification condition, we obtain a formula of subdifferential for composite functions and study a cone constraint composite DC optimization problem in locally convex Hausdorff topological vector spaces.

[1]  Regina Sandra Burachik,et al.  A new geometric condition for Fenchel's duality in infinite dimensional spaces , 2005, Math. Program..

[2]  Gert Wanka,et al.  A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces , 2006 .

[3]  Marc Teboulle,et al.  A comparison of constraint quali cations in in nite-dimensional convex programming , 1990 .

[4]  Xiaoqi Yang,et al.  STABLE STRONG AND TOTAL PARAMETRIZED DUALITIES FOR DC OPTIMIZATION PROBLEMS IN LOCALLY CONVEX SPACES , 2013 .

[5]  S. Simons,et al.  The Conjugates, Compositions and Marginals of Convex Functions , 2001 .

[6]  Sorin-Mihai Grad,et al.  A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces , 2008 .

[7]  C. Zălinescu.  Convex analysis in general vector spaces , 2002 .

[8]  H. Tuy.  Convex analysis and global optimization , 1998 .

[9]  Miguel A. Goberna,et al.  From linear to convex systems: consistency, Farkas' Lemma and applications , 2006 .

[10]  J. Toland.  Duality in nonconvex optimization , 1978 .

[11]  N. Dinh,et al.  A closedness condition and its applications to DC programs with convex constraints , 2010 .

[12]  G. A. Garreau,et al.  Mathematical Programming and Control Theory , 1979, Mathematical Gazette.

[13]  Radu Ioan Bot,et al.  Regularity Conditions via Quasi-Relative Interior in Convex Programming , 2008, SIAM J. Optim..

[14]  Sorin-Mihai Grad,et al.  Generalized Moreau–Rockafellar results for composed convex functions , 2009 .

[15]  Sorin-Mihai Grad,et al.  On strong and total Lagrange duality for convex optimization problems , 2008 .

[16]  Le Thi Hoai An,et al.  The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems , 2005, Ann. Oper. Res..

[17]  Gert Wanka,et al.  An alternative formulation for a new closed cone constraint qualification , 2006 .

[18]  Chong Li,et al.  Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces , 2009, SIAM J. Optim..

[19]  Jonathan M. Borwein,et al.  Partially finite convex programming, Part I: Quasi relative interiors and duality theory , 1992, Math. Program..

[20]  Marco A. López,et al.  New Farkas-type constraint qualifications in convex infinite programming , 2007 .

[21]  Chong Li,et al.  The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces , 2007, SIAM J. Optim..

[22]  Gert Wanka,et al.  Farkas-type results for inequality systems with composed convex functions via conjugate duality , 2006 .

[23]  Le Thi Hoai An,et al.  An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints , 2000, Math. Program..