New regularity conditions for strong and total Fenchel–Lagrange duality in infinite dimensional spaces

Abstract We give new regularity conditions for convex optimization problems in separated locally convex spaces. We completely characterize the stable strong and strong Fenchel–Lagrange duality. Then we give similar statements for the case when a solution of the primal problem is assumed as known, obtaining complete characterizations for the so-called total and stable totalFenchel–Lagrange duality, respectively. For particular settings the conditions that we consider turn into some constraint qualifications already used by different authors, like Farkas–Minkowski CQ , locally Farkas–Minkowski CQ and basic CQ , and we rediscover and improve some recent results from the literature.

[1]  C. Tammer,et al.  Theory of Vector Optimization , 2003 .

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

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

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

[5]  Constantin Zalinescu,et al.  On the Necessity of some Constraint Qualiflcation Conditions in Convex Programming , 2004 .

[6]  Sorin-Mihai Grad,et al.  New regularity conditions for Lagrange and Fenchel-Lagrange duality in infinite dimensional spaces , 2009 .

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

[8]  Marco A. López,et al.  Farkas-Minkowski systems in semi-infinite programming , 1981 .

[9]  The Hahn–Banach–Lagrange theorem , 2007 .

[10]  Chong Li,et al.  On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space , 2005, SIAM J. Optim..

[11]  Marco A. López,et al.  Locally Farkas–Minkowski Systems in Convex Semi-Infinite Programming , 1999 .

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

[13]  J. Penot,et al.  Semi-continuous mappings in general topology , 1982 .

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

[15]  C. Combari,et al.  Sous-différentiels de fonctions convexes composées , 1994 .

[16]  V. Jeyakumar,et al.  A Dual Condition for the Convex Subdifferential Sum Formula with Applications , 2022 .

[17]  Hui Hu,et al.  Characterizations of the Strong Basic Constraint Qualifications , 2005, Math. Oper. Res..

[18]  Marco A. López,et al.  Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities , 2008 .