IDEAS home Printed from
   My bibliography  Save this article

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


  • Oliver Stein


  • Nathan Sudermann-Merx



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. Copyright Springer-Verlag Berlin Heidelberg 2014

Suggested Citation

  • Oliver Stein & Nathan Sudermann-Merx, 2014. "On smoothness properties of optimal value functions at the boundary of their domain under complete convexity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 79(3), pages 327-352, June.
  • Handle: RePEc:spr:mathme:v:79:y:2014:i:3:p:327-352
    DOI: 10.1007/s00186-014-0465-x

    Download full text from publisher

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. Axel Dreves & Christian Kanzow & Oliver Stein, 2012. "Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems," Journal of Global Optimization, Springer, vol. 53(4), pages 587-614, August.
    2. Stein, Oliver, 2012. "How to solve a semi-infinite optimization problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 312-320.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. repec:spr:joptap:v:170:y:2016:i:2:d:10.1007_s10957-015-0779-8 is not listed on IDEAS
    2. repec:spr:coopap:v:68:y:2017:i:3:d:10.1007_s10589-017-9927-4 is not listed on IDEAS


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:79:y:2014:i:3:p:327-352. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.