IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v162y2014i1d10.1007_s10957-013-0432-3.html
   My bibliography  Save this article

Local–Global Minimum Property in Unconstrained Minimization Problems

Author

Listed:
  • Pál Burai

    (TU Berlin)

Abstract

The main goal of this paper is to prove some new results and extend some earlier ones about functions, which possess the so-called local–global minimum property. In the last section, we show an application of these in the theory of calculus of variations.

Suggested Citation

  • Pál Burai, 2014. "Local–Global Minimum Property in Unconstrained Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 162(1), pages 34-46, July.
    • Handle: RePEc:spr:joptap:v:162:y:2014:i:1:d:10.1007_s10957-013-0432-3
    DOI: 10.1007/s10957-013-0432-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-013-0432-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-013-0432-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. D. T. Luc & M. Volle, 1997. "Levels Sets Infimal Convolution and Level Addition," Journal of Optimization Theory and Applications, Springer, vol. 94(3), pages 695-714, September.
    2. D. Bhatia & A. Mehra, 1999. "Optimality Conditions and Duality Involving Arcwise Connected and Generalized Arcwise Connected Functions," Journal of Optimization Theory and Applications, Springer, vol. 100(1), pages 181-194, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Qingxiang Zhang, 2009. "Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions," Computational Optimization and Applications, Springer, vol. 45(4), pages 615-629, December.
    2. Tadeusz Antczak & Najeeb Abdulaleem, 2021. "E-differentiable minimax programming under E-convexity," Annals of Operations Research, Springer, vol. 300(1), pages 1-22, May.
    3. J.Y. Fu & Y.H. Wang, 2003. "Arcwise Connected Cone-Convex Functions and Mathematical Programming," Journal of Optimization Theory and Applications, Springer, vol. 118(2), pages 339-352, August.

    Corrections

    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:joptap:v:162:y:2014:i:1:d:10.1007_s10957-013-0432-3. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.