Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings

In this paper we develop general formulas for the subdifferential of the pointwise supremum of convex functions, which cover and unify both the compact continuous and the non-compact non-continuous settings. From the non-continuous to the continuous setting, we proceed by a compactification-based approach which leads us to problems having compact index sets and upper semi-continuously indexed mappings, giving rise to new characterizations of the subdifferential of the supremum by means of upper semicontinuous regularized functions and an enlarged compact index set. In the opposite sense, we rewrite the subdifferential of these new regularized functions by using the original data, also leading us to new results on the subdifferential of the supremum. We give two applications in the last section, the first one concerning the nonconvex Fenchel duality, and the second one establishing Fritz-John and KKT conditions in convex semi-infinite programming.

[1]  Arne Brondsted.  On the Subdifferential of the Supremum of Two Convex Functions. , 1972 .

[2]  R. Correa,et al.  Subdifferential of the Supremum via Compactification of the Index Set , 2020 .

[3]  Abderrahim Hantoute,et al.  Lower Semicontinuous Convex Relaxation in Optimization , 2013, SIAM J. Optim..

[4]  R. Correa,et al.  Valadier-like formulas for the supremum function II: The compactly indexed case , 2017, 1707.03782.

[5]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[6]  V. N. Solov'ev,et al.  The subdifferential and the directional derivatives of the maximum of a family of convex functions , 1998 .

[7]  M. Volle.  Sous-différentiel d'une enveloppe supérieure de fonctions convexes , 1993 .

[8]  R. Phelps,et al.  Subdifferential Calculus Using ϵ-Subdifferentials , 1993 .

[9]  M. A. López-Cerdá,et al.  Linear Semi-Infinite Optimization , 1998 .

[10]  Abderrahim Hantoute,et al.  Moreau-Rockafellar-Type Formulas for the Subdifferential of the Supremum Function , 2019, SIAM J. Optim..

[11]  R. Correa,et al.  Nonconvex integration using ϵ-subdifferentials , 2018, Optimization.

[12]  Chong Li,et al.  Subdifferential Calculus Rules for Supremum Functions in Convex Analysis , 2011, SIAM J. Optim..

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

[14]  A. Ioffe.  A note on subdifferentials of pointwise suprema , 2012 .

[15]  Boris S. Mordukhovich,et al.  Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data , 2013, SIAM J. Optim..

[16]  Michel Volle,et al.  A FORMULA FOR THE SET OF OPTIMAL SOLUTIONS OF A RELAXED MINIMIZATION PROBLEM. APPLICATIONS TO SUBDIFFERENTIAL CALCULUS , 2008 .

[17]  Constantin Zalinescu,et al.  Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions , 2008, SIAM J. Optim..

[18]  J. Frédéric Bonnans,et al.  Perturbation Analysis of Optimization Problems , 2000, Springer Series in Operations Research.

[19]  B. N. Pshenichnyi.  Convex programming in a normalized space , 1965 .

[20]  M. Fabian,et al.  Functional Analysis and Infinite-Dimensional Geometry , 2001 .

[21]  R. Correa,et al.  New Formulas for the Fenchel Subdifferential of the Conjugate Function , 2010 .

[22]  R. Correa,et al.  Subdifferential of the conjugate function in general Banach spaces , 2012 .

[23]  A. Ioffe,et al.  Theory of extremal problems , 1979 .

[24]  Jean-Pierre Aubin,et al.  Subdifferentials of Convex Functions , 1998 .

[25]  R. Correa,et al.  Weaker conditions for subdifferential calculus of convex functions , 2016 .