Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function

DOI10.1137/18M1169370zbMath1415.49012MaRDI QIDQ4634099

Marco A. López, Rafael Correa, Abderrahim Hantoute

Publication date: 7 May 2019

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

convex functionssupremum functionqualification conditionssubdifferential calculus rulesweak continuity assumption

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Methods involving semicontinuity and convergence; relaxation (49J45) Continuity and differentiation questions (26B05) Convexity of real functions of several variables, generalizations (26B25)

Related Items

Marco A. López, a pioneer of continuous optimization in Spain, Conjugation-based approach to the \(\varepsilon\)-subdifferential of convex suprema, Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings, Duality for constrained robust sum optimization problems, Subdifferential of the supremum via compactification of the index set, Parabolic regularity in geometric variational analysis, Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex functions, monotone operators and differentiability.
• Subsmooth semi-infinite and infinite optimization problems
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
• Subdifferential calculus using \(\varepsilon\)-subdifferentials
• A dual approach to constrained interpolation from a convex subset of Hilbert space
• On the subdifferential of an upper envelope of convex functions
• Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation
• A note on subdifferentials of pointwise suprema
• Optimality conditions in convex optimization revisited
• Weaker conditions for subdifferential calculus of convex functions
• The subdifferential and the directional derivatives of the maximum of a family of convex functions. II
• Asymptotic optimality conditions for linear semi-infinite programming
• Towards Supremum-Sum Subdifferential Calculus Free of Qualification Conditions
• Subdifferential Calculus Rules for Supremum Functions in Convex Analysis
• Optimality conditions for nondifferentiable convex semi-infinite programming
• The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
• Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
• Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
• Directionally Lipschitzian Functions and Subdifferential Calculus
• Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
• Valadier-like formulas for the supremum function I
• Valadier-like formulas for the supremum function II: The compactly indexed case
• Subdifferentials of Nonconvex Supremum Functions and Their Applications to Semi-infinite and Infinite Programs with Lipschitzian Data
• New Farkas-type constraint qualifications in convex infinite programming
• Convex Analysis
• On the Subdifferential of the Supremum of Two Convex Functions.