Abstract
Starting with some analysis of the support function of an arbitrary set, we obtain a formula for the subdifferential set of the supremum function of an arbitrary (possibly infinite) family of proper convex functions at each point of its effective domain, not necessarily at a continuity point. In this sense, our formula constitutes an extension of Theorem A of M. Volle ["Sous-différentiel d'une enveloppe supérieure de fonctions convexes", Comptes Rendus Acad. Sci. Paris I 317 (1993) 845-849], and also allows us to derive a generalization of a result A. Brøndsted ["On the subdifferential of the supremum of two convex functions", Math. Scand. 31 (1972) 225-230]. Our approach is based on a linearization via the Fenchel conjugate.
References
- A. Auslender, M. Teboulle: Asymptotic Cones and Functions in Optimization and Variational Inequalities, Springer, New York (2000).Google Scholar
- A. Brøndsted: On the subdifferential of the supremum of two convex functions, Math. Scand. 31 (1972) 225–230.https://doi.org/10.7146/math.scand.a-11428Google Scholar
- J. M. Danskin: The Theory of Max-Min and its Application to Weapons Allocation Problems, Springer, Berlin (1967).https://doi.org/10.1007/978-3-642-46092-0Google Scholar
- M. A. Goberna, M. A. López: Optimal value function in semi-infinite programming, J. Optimization Theory Appl. 59 (1988) 261–279.https://doi.org/10.1007/BF00938312Google Scholar
- J.-B. Hiriart-Urruty, C. Lemaréchal: Convex Analysis and Minimization Algorithms I, II, Springer, Berlin (1993).https://doi.org/10.1007/978-3-662-02796-7Google Scholar
- J.-B. Hiriart-Urruty, M. Moussaoui, A. Seeger, M. Volle: Subdifferential calculus without qualification conditions, using approximate subdifferentials: a survey, Nonlinear Anal., Theory Methods Appl. 24 (1995) 1727–1754.https://doi.org/10.1016/0362-546X(94)00221-3Google Scholar
- A. D. Ioffe, V. L. Levin: Subdifferentials of convex functions, Tr. Mosk. Mat. Obshch. 26 (1972) 3–73 (in Russian).Google Scholar
- B. N. Pschenichnyi: Convex programming in a normalized space, Kibernetika 5 (1965) 46–54 (in Russian); Engl. transl.: Cybernetics 1(5) (1965) 46–57.https://doi.org/10.1007/BF01071427https://doi.org/10.1007/BF01074698Google Scholar
- R. T Rockafellar: Convex Analysis, Princeton University Press, Princeton (1970).https://doi.org/10.1515/9781400873173Google Scholar
- R. T Rockafellar: Directionally Lipschitzian functions and subdifferential calculus, Proc. Lond. Math. Soc., III. Ser. 39 (1979) 331–355.https://doi.org/10.1112/plms/s3-39.2.331Google Scholar
- V. N. Solov’ev: The subdifferential and the directional derivatives of the maximum of a family of convex functions, Izv. Ross. Akad. Nauk, Ser. Mat. 62(4) (1998) 173–200 (in Russian); Engl. transl.: Izv. Math. 62(4) (1998) 807–832.https://doi.org/10.4213/im192https://doi.org/10.1070/IM1998v062n04ABEH000192Google Scholar
- V. N. Solov’ev: The subdifferential and the directional derivatives of the maximum of a family of convex functions, Izv. Ross. Akad. Nauk, Ser. Mat. 65(1) (2001) 107–132 (in Russian); Engl. transl.: Izv. Math. 65(1) (2001) 99–121.https://doi.org/10.4213/im323https://doi.org/10.1070/IM2001v065n01ABEH000323Google Scholar
- M. Valadier: Sous-différentiels d’une borne supérieure et d’une somme continue de fonctions convexes, C. R. Acad. Sci., Paris, Sér. A 268 (1969) 39–42.Google Scholar
- M. Volle: Sous-différentiel d’une enveloppe supérieure de fonctions convexes, C. R. Acad. Sci., Paris, Sér. I 317 (1993) 845–849.Google Scholar
- M. Volle: On the subdifferential of an upper envelope of convex functions, Acta Math. Vietnam. 19(2) (1994) 137–148.Google Scholar
- C. Zălinescu: Convex Analysis in General Vector Spaces, World Scientific, Singapore (2002).https://doi.org/10.1142/5021Google Scholar
Suggested citation
Published by Heldermann Verlag, 2008. Rights now held by Banach Press LLC.
