Abstract
We revisit a theorem by Rockafellar on representing the relative interior of the graph of a convex set-valued mapping in terms of the relative interior of its domain and function values. Then we apply this theorem to provide a simple way to prove many calculus rules of generalized differentiation for set-valued mappings and nonsmooth functions in finite dimensions. Using this important theorem by Rockafellar allows us to improve some results on generalized differentiation of set-valued mappings of B. S. Mordukhovich and N. M. Nam [Geometric approach to convex subdifferential calculus, Optimization 66 (2017) 839–873] by replacing the relative interior qualifications on graphs with qualifications on domains and/or ranges.
References
- H. H. Bauschke, P. L. Combettes: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, Springer, New York (2011).https://doi.org/10.1007/978-1-4419-9467-7Google Scholar
- D. P. Bertsekas, A. Nedić, A. E. Ozdaglar: Convex Analysis and Optimization, Athena Scientific, Belmont (2003).Google Scholar
- J. M. Borwein, A. S. Lewis: Partially finite convex programming. I: Quasi-relative interiors and duality theory, Math. Programming 57 (1992) 15–48.https://doi.org/10.1007/BF01581072Google Scholar
- J. M. Borwein, A. S. Lewis: Convex Analysis and Nonlinear Optimization, Springer, New York (2000).https://doi.org/10.1007/978-1-4757-9859-3Google Scholar
- S. Boyd, L. Vandenberghe: Convex Optimization, Cambridge University Press, New York (2004).https://doi.org/10.1017/CBO9780511804441Google Scholar
- D. V. Cuong, B. S. Mordukhovich, N. M. Nam: Quasi-relative interiors for graphs of convex set-valued mappings, Optimization Letters 15 (2021) 933–952.https://doi.org/10.1007/s11590-019-01447-4Google Scholar
- F. Giannessi: Constrained Optimization and Image Space Analysis. I: Separation of Sets and Optimality Conditions, Springer, Berlin (2005).https://doi.org/10.1007/0-387-28020-0Google Scholar
- J.-B. Hiriart-Urruty, C. Lemaréchal: Fundamentals of Convex Analysis, Springer, Berlin (2001).https://doi.org/10.1007/978-3-642-56468-0Google Scholar
- A. A. Khan, C. Tammer, C. Zălinescu: Set-valued Optimization, Springer, New York (2015).https://doi.org/10.1007/978-3-642-54265-7Google Scholar
- A. G. Kusraev, S. S. Kutateladze: Subdifferentials: Theory and Applications, Kluwer, Dordrecht (1995).https://doi.org/10.1007/978-94-011-0265-0Google Scholar
- B. S. Mordukhovich: Variational Analysis and Applications, Springer, Cham (2018).https://doi.org/10.1007/978-3-319-92775-6Google Scholar
- B. S. Mordukhovich, N. M. Nam: An Easy Path to Convex Analysis and Applications, Morgan & Claypool, San Rafael (2014); reprinted by Springer, Cham (2022).https://doi.org/10.1007/978-3-031-02406-1Google Scholar
- B. S. Mordukhovich, N. M. Nam: Geometric approach to convex subdifferential calculus, Optimization 66 (2017) 839–873.https://doi.org/10.1080/02331934.2015.1105225Google Scholar
- B. S. Mordukhovich, N. M. Nam: Convex Analysis and Beyond. I: Basic Theory, Springer, Cham (2022).https://doi.org/10.1007/978-3-030-94785-9Google Scholar
- D. Pallaschke, S. Rolewicz: Foundation of Mathematical Optimization: Convex Analysis without Linearity, Kluwer, Dordrecht (1998).https://doi.org/10.1007/978-94-017-1588-1Google Scholar
- R. T. Rockafellar: Convex Analysis, Princeton University Press, Princeton (1970).https://doi.org/10.1515/9781400873173Google Scholar
- R. T. Rockafellar, R. J.-B. Wets: Variational Analysis, Springer, Berlin (1998).https://doi.org/10.1007/978-3-642-02431-3Google Scholar
- E. Steinitz: Bedingt konvergente Reihen und konvexe Systeme I, J. Math. 143 (1913) 128–175.https://doi.org/10.1515/crll.1913.143.128Google Scholar
Suggested citation
Published by Heldermann Verlag, 2023. Rights now held by Banach Press LLC.
