On smoothness properties of optimal value functions at the boundary of their domain under complete convexity
- 233 Downloads
This article studies continuity and directional differentiability properties of optimal value functions, in particular at boundary points of their domain. We extend and complement standard continuity results from Hogan (SIAM Rev 15:591–603, 1973a) for abstract feasible set mappings under complete convexity as well as standard differentiability results from Hogan (Oper Res 21:188–209, 1973b) for feasible set mappings in functional form under the Slater condition in the unfolded feasible set. In particular, we present sufficient conditions for the inner semi-continuity of feasible set mappings and, using techniques from nonsmooth analysis, provide functional descriptions of tangent cones to the domain of the optimal value function. The latter makes the stated directional differentiability results accessible for practical applications.
KeywordsComplete convexity Slater condition Inner semi-continuity Directional differentiability Nonsmooth linearization cone
Mathematics Subject Classification (2010)90C31 90C25
We thank the anonymous referee for his or her precise and substantial remarks which helped to significantly improve the paper. Moreover, we are grateful to Christian Kanzow, Diethard Klatte and Robert Mohr for fruitful discussions on earlier versions of this paper, and to Georg Still for pointing out the reference Schneider (1993) to us.
- Gol’stein EG (1972) Theory of convex programming, Translations of mathematical monographs, vol 36. American Mathematical Society, Providence, Rhode IslandGoogle Scholar
- Gugat M (1998) Parametric convex optimization: one-sided derivatives of the value function in singular parameters. In: Butzer PL (ed) et al. Karl der Große und sein Nachwirken. 1200 Jahre Kultur und Wissenschaft in Europa. Band 2: Mathematisches Wissen, Brepols, pp 471–483Google Scholar
- Harms N, Kanzow C, Stein O (2013) On differentiability properties of player convex generalized Nash equilibrium problems. Optimization, iFirst, doi: 10.1080/02331934.2012.752822
- Hiriart-Urruty J-B, Lemaréchal C (1996) Convex analysis and minimization algorithms I. Springer, BerlinGoogle Scholar
- Psenichny BN (1980) Convex analysis and extremal problems. Nauka, Moskow (in Russian)Google Scholar