Skip to main content
Log in

On smoothness properties of optimal value functions at the boundary of their domain under complete convexity

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  • Bank B, Guddat J, Klatte D, Kummer B, Tammer K (1982) Non-linear parametric optimization. Akademie-Verlag, Berlin

    Book  Google Scholar 

  • Borwein JM, Lewis AS (2006) Convex analysis and nonlinear optimization. Springer, Berlin

    Book  MATH  Google Scholar 

  • Bonnans JF, Shapiro A (1998) Optimization problems with perturbations: a guided tour. SIAM Rev 40:228–264

    Article  MATH  MathSciNet  Google Scholar 

  • Dreves A, Kanzow C, Stein O (2012) Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems. J Glob Optim 53:587–614

    Article  MATH  MathSciNet  Google Scholar 

  • Gale D, Klee V, Rockafellar RT (1968) Convex functions on convex polytopes. Proc Am Math Soc 19:867–873

    Article  MATH  MathSciNet  Google Scholar 

  • Gauvin J (1977) A necessary and sufficient regularity condition to have bounded multipliers in nonconvex optimization. Math Program 12:136–138

    Article  MATH  MathSciNet  Google Scholar 

  • Gol’stein EG (1972) Theory of convex programming, Translations of mathematical monographs, vol 36. American Mathematical Society, Providence, Rhode Island

  • Gollan B (1984) On the marginal function in nonlinear programming. Math Oper Res 9:208–221

    Article  MATH  MathSciNet  Google 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–483

  • 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, Berlin

    Google Scholar 

  • Hogan WW (1973a) Point-to-set maps in mathematical programming. SIAM Rev 15:591–603

    Article  MATH  MathSciNet  Google Scholar 

  • Hogan WW (1973b) Directional derivatives for extremal-value functions with applications to the completely convex case. Oper Res 21:188–209

    Article  MATH  MathSciNet  Google Scholar 

  • Janin R (1984) Directional derivative of the marginal function in nonlinear programming. Math Program Study 21:110–126

    Article  MATH  MathSciNet  Google Scholar 

  • Klatte D (1984) A sufficient condition for lower semicontinuity of solutions sets of systems of convex inequalities. Math Program Study 21:139–149

    Article  MATH  MathSciNet  Google Scholar 

  • Klatte D (1997) Lower semicontinuity of the minimum in parametric convex programs. J Optim Theory Appl 94:511–517

    Article  MATH  MathSciNet  Google Scholar 

  • Maćkowiak P (2006) Some remarks on lower hemicontinuity of convex multivalued mapping. Econ Theory 28:227–233

    Article  MATH  Google Scholar 

  • Psenichny BN (1980) Convex analysis and extremal problems. Nauka, Moskow (in Russian)

  • Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton, NJ

    MATH  Google Scholar 

  • Rockafellar RT (1984) Directional differentiability of the optimal value function in a nonlinear programming problem. Math Program Study 21:213–226

    Article  MATH  MathSciNet  Google Scholar 

  • Rockafellar RT, Wets RJB (1998) Variational analysis. Springer, Berlin

    Book  MATH  Google Scholar 

  • Schneider R (1993) Convex bodies: the Brunn–Minkowski theory. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  • Stein O (2004) On constraint qualifications in nonsmooth optimization. J Optim Theory Appl 121:647–671

    Article  MATH  MathSciNet  Google Scholar 

  • Stein O (2003) Bi-level strategies in semi-infinite programming. Kluwer, Boston

    Book  MATH  Google Scholar 

  • Stein O (2012) How to solve a semi-infinite optimization problem. Eur J Oper Res 223:312–320

    Article  Google Scholar 

Download references

Acknowledgments

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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Oliver Stein.

Additional information

This research was partially supported by the DFG (Deutsche Forschungsgemeinschaft) under grant STE 772/13-1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stein, O., Sudermann-Merx, N. On smoothness properties of optimal value functions at the boundary of their domain under complete convexity. Math Meth Oper Res 79, 327–352 (2014). https://doi.org/10.1007/s00186-014-0465-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-014-0465-x

Keywords

Mathematics Subject Classification (2010)

Navigation