Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions

Authors:
A. Hantoute;M. A. López;C. Zălinescu
Affiliations:
hantoute@ua.es;marco.antonio@ua.es;zalinesc@uaic.ro
Venue:
SIAM Journal on Optimization
Year:
2008

Citing 0
Cited 3

Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming

SIAM Journal on Optimization
Stability of Error Bounds for Semi-infinite Convex Constraint Systems

SIAM Journal on Optimization
Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization

SIAM Journal on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a rule to calculate the subdifferential set of the pointwise supremum of an arbitrary family of convex functions defined on a real locally convex topological vector space. Our formula is given exclusively in terms of the data functions and does not require any assumption either on the index set on which the supremum is taken or on the involved functions. Some other calculus rules, namely chain rule formulas of standard type, are obtained from our main result via new and direct proofs.