A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces

99 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (2010, background): “in [37] where they require (f + h)(p) = (f ∗ h)(p) to hold for every p in X rather than only at 0 here.”
A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces (2008, unknown): “By Proposition 3.2 one can see that (CQ) may be equivalently written cl ( epi(F ∗) + epi(G∗) ) ∩ (X∗ × {0} × R) = ( epi(F ∗) + epi(G∗) ) ∩ (X∗ × {0} × R).”