20101 Pure Mathematics
2Convex functions
2Fenchel subdifferential
10102 Applied Mathematics
10103 Numerical and Computational Mathematics
1Convex infinite-dimensional
1Fenchel and approximate subdifferentials
1Optimization
1Pointwise supremum function
1Subdifferential calculus rules
1Sum and pointwise supremum of convex functions
1Valadier-like formulas

Show More

Show Less

Format Type

Towards supremum-sum subdifferential calculus free of qualification conditions

- Correa, Rafael, Hantoute, Abderrahim, López, Marco

**Authors:**Correa, Rafael , Hantoute, Abderrahim , López, Marco**Date:**2016**Type:**Text , Journal article**Relation:**Siam Journal on Optimization Vol. 26, no. 4 (2016), p. 2219-2234**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**We give a formula for the subdifferential of the sum of two convex functions where one of them is the supremum of an arbitrary family of convex functions. This is carried out under a weak assumption expressing a natural relationship between the lower semicontinuous envelopes of the data functions in the domain of the sum function. We also provide a new rule for the subdifferential of the sum of two convex functions, which uses a strategy of augmenting the involved functions. The main feature of our analysis is that no continuity-type condition is required. Our approach allows us to unify, recover, and extend different results in the recent literature.

**Authors:**Correa, Rafael , Hantoute, Abderrahim , López, Marco**Date:**2016**Type:**Text , Journal article**Relation:**Siam Journal on Optimization Vol. 26, no. 4 (2016), p. 2219-2234**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**We give a formula for the subdifferential of the sum of two convex functions where one of them is the supremum of an arbitrary family of convex functions. This is carried out under a weak assumption expressing a natural relationship between the lower semicontinuous envelopes of the data functions in the domain of the sum function. We also provide a new rule for the subdifferential of the sum of two convex functions, which uses a strategy of augmenting the involved functions. The main feature of our analysis is that no continuity-type condition is required. Our approach allows us to unify, recover, and extend different results in the recent literature.

Weaker conditions for subdifferential calculus of convex functions

- Correa, Rafael, Hantoute, Abderrahim, López, Marco

**Authors:**Correa, Rafael , Hantoute, Abderrahim , López, Marco**Date:**2016**Type:**Text , Journal article**Relation:**Journal of Functional Analysis Vol. 271, no. 5 (2016), p. 1177-1212**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:**false**Reviewed:****Description:**In this paper we establish new rules for the calculus of the subdifferential mapping of the sum of two convex functions. Our results are established under conditions which are at an intermediate level of generality among those leading to the Hiriart-Urruty and Phelps formula (Hiriart-Urruty and Phelps, 1993 [15]), involving the approximate subdifferential, and the stronger assumption used in the well-known Moreau-Rockafellar formula (Rockafellar 1970, [23]; Moreau 1966, [20]), which only uses the exact subdifferential. We give an application to derive asymptotic optimality conditions for convex optimization.**Description:**In this paper we establish new rules for the calculus of the subdifferential mapping of the sum of two convex functions. Our results are established under conditions which are at an intermediate level of generality among those leading to the Hiriart-Urruty and Phelps formula (Hiriart-Urruty and Phelps, 1993 [15]), involving the approximate subdifferential, and the stronger assumption used in the well-known Moreau-Rockafellar formula (Rockafellar 1970, [23]; Moreau 1966, [20]), which only uses the exact subdifferential. We give an application to derive asymptotic optimality conditions for convex optimization. (C) 2016 Elsevier Inc. All rights reserved.

Valadier-like formulas for the supremum function I

- Correa, Rafael, Hantoute, Abderrahim, López, Marco

**Authors:**Correa, Rafael , Hantoute, Abderrahim , López, Marco**Date:**2018**Type:**Text , Journal article**Relation:**Journal of Convex Analysis Vol. 25, no. 4 (2018), p. 1253-1278**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:**false**Reviewed:****Description:**We generalize and improve the original characterization given by Valadier [19, Theorem 1] of the subdifferential of the pointwise supremum of convex functions, involving the subdifferentials of the data functions at nearby points. We remove the continuity assumption made in that work and obtain a general formula for such a subdifferential. In particular, when the supremum is continuous at some point of its domain, but not necessarily at the reference point, we get a simpler version which gives rise to the Valadier formula. Our starting result is the characterization given in [11, Theorem 4], which uses the e-subdifferential at the reference point.

- «
- ‹
- 1
- ›
- »

Are you sure you would like to clear your session, including search history and login status?