Support points of lower semicontinuous functions with respect to the set of Lipschitz concave functions

For the functions defined on normed vector spaces, we introduce a new notion of the LC -convexity that generalizes the classical notion of convex functions. A function is called to be LC -convex if it can be represented as the upper envelope of some subset of Lipschitz concave functions. It is proved that the function is LC -convex if and only if it is lower semicontinuous and, in addition, it is bounded from below by a Lipschitz function. As a generalization of a global subdifferential of a classically convex function, we introduce the set of LC -minorants supported to a function at a given point and the set of LC -support points of a function that are then used to derive a criterion for global minimum points and a necessary condition for global maximum points of nonsmooth functions. An important result of the article is to prove that for a LC -
convex function, the set of LC -support points is dense in its effective domain. This result extends the well-known Brondsted– Rockafellar theorem on the existence of the sub-differential for classically convex lower semicontinuous functions to a wider class of lower semicontinuous functions and goes back to the one of the most important results of the classical convex analysis – the Bishop–Phelps theorem on the density of support points in the boundary of a closed convex set.

1. Ekeland I., Temam R. Convex Analysis and Variational Problems. Amsterdam, 1976. 402 p. https://doi.org/10.1016/c2009-0-19672-1

2. Rockafellar R. T. Convex analysis. Princeton, 1970. 451 p.

3. Polovinkin E. S, Balashov M. V. Elements of convex and strongly convex analysis. Moscow, Fizmatlit Publ., 2004. 416 p. (in Russian).

4. Penot J.-P. Calcul Sous-Differential et Optimization. Journal of Functional Analysis, 1978, vol. 27, no. 2, pp. 248–276. https://doi.org/10.1016/0022-1236(78)90030-7

5. Clarke F. Optimization and Nonsmooth Analysis. New York, 1983. 306 p. https://doi.org/10.1137/1.9781611971309

6. Michel P., Penot J.-P. Calcul sous-differential pour les fonctions lipschitzienness et non-lipschitziennes. Paris, 1984, ser. I, vol. 298, no. 12, pp. 269–272.

7. Kruger A. Y. On Fréchet subdifferentials. Journal of Mathematical Sciences, 2003, vol. 116, no. 3, pp. 3325–3358. https://doi.org/10.1023/a:1023673105317

8. Mordukhovich B. S. Variational Analysis and Generalized Differentiation. I: Basic Theory. Berlin, 2006. 579 p. https://doi.org/10.1007/3-540-31247-1

9. Kutateladze S. S., Rubinov A. M. Minkowski duality and its applications. Novosibirsk, Nauka Publ., 1976. 254 p. (in Russian).

10. Pallaschke D., Rolewicz S. Foundations of Mathematical Optimization (Convex analysis without linearity). Dordrecht, 1997. 585 p. https://doi.org/10.1007/978-94-017-1588-1

11. Singer I. Abstract Convex Analysis. New York, 1997. 491 p.

12. Rubinov A. M. Abstract convexity and global optimization. Dordrecht, 2000. 493 р. https://doi.org/10.1007/978-1-4757-3200-9

13. Brøndsted A., Rockafellar R. T. On the subdifferentiability of convex functions. Proceedings of the American Mathematical Society, 1965, vol. 16, no. 4, pp. 605–611. https://doi.org/10.1090/s0002-9939-1965-0178103-8

14. Bishop E., Phelps R. R. The support functionals of convex sets. Proceedings of Symposia in Pure Mathematics, 1963, vol. VII, pp. 27–35. https://doi.org/10.1090/pspum/007/0154092

15. Gorokhovik V. V. Minimal convex majorants of functions and Demyanov–Rubinov exhaustive super(sub)differentials. Optimization, 2019, vol. 68, no. 10, pp. 1933–1961. https://doi.org/10.1080/02331934.2018.1518446