IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v65y2016i3d10.1007_s10898-015-0379-z.html
   My bibliography  Save this article

A sharp Lagrange multiplier theorem for nonlinear programs

Author

Listed:
  • M. Ruiz Galán

    (University of Granada)

Abstract

For a nonlinear program with inequalities and under a Slater constraint qualification, it is shown that the duality between optimal solutions and saddle points for the corresponding Lagrangian is equivalent to the infsup-convexity—a not very restrictive generalization of convexity which arises naturally in minimax theory—of a finite family of suitable functions. Even if we dispense with the Slater condition, it is proven that the infsup-convexity is nothing more than an equivalent reformulation of the Fritz John conditions for the nonlinear optimization problem under consideration.

Suggested Citation

  • M. Ruiz Galán, 2016. "A sharp Lagrange multiplier theorem for nonlinear programs," Journal of Global Optimization, Springer, vol. 65(3), pages 513-530, July.
  • Handle: RePEc:spr:jglopt:v:65:y:2016:i:3:d:10.1007_s10898-015-0379-z
    DOI: 10.1007/s10898-015-0379-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-015-0379-z
    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/s10898-015-0379-z?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. T. Illés & G. Kassay, 1999. "Theorems of the Alternative and Optimality Conditions for Convexlike and General Convexlike Programming," Journal of Optimization Theory and Applications, Springer, vol. 101(2), pages 243-257, May.
    2. Nguyen Huy Chieu & Gue Myung Lee, 2014. "Constraint Qualifications for Mathematical Programs with Equilibrium Constraints and their Local Preservation Property," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 755-776, December.
    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. Frenk, J.B.G. & Kassay, G. & Kolumban, J., 2002. "Equivalent Results in Minimax Theory," ERIM Report Series Research in Management ERS-2002-08-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    2. Manh-Hung Nguyen & Do Van Luu, 2006. "On constraint qualifications with generalized convexity and optimality conditions," Post-Print halshs-00113148, HAL.
    3. P. Montiel López & M. Ruiz Galán, 2016. "Nonlinear Programming via König’s Maximum Theorem," Journal of Optimization Theory and Applications, Springer, vol. 170(3), pages 838-852, September.
    4. P. H. Sach, 2007. "Moreau–Rockafellar Theorems for Nonconvex Set-Valued Maps," Journal of Optimization Theory and Applications, Springer, vol. 133(2), pages 213-227, May.
    5. Frenk, J. B. G. & Kassay, G. & Kolumban, J., 2004. "On equivalent results in minimax theory," European Journal of Operational Research, Elsevier, vol. 157(1), pages 46-58, August.
    6. Do Van Luu & Manh Hung Nguyen, 2006. "On alternative theorems and necessary conditions for efficiency," Cahiers de la Maison des Sciences Economiques b06019, Université Panthéon-Sorbonne (Paris 1).
    7. Adan, M. & Novo, V., 2003. "Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness," European Journal of Operational Research, Elsevier, vol. 149(3), pages 641-653, September.
    8. Sajjad Kazemi & Nader Kanzi, 2018. "Constraint Qualifications and Stationary Conditions for Mathematical Programming with Non-differentiable Vanishing Constraints," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 800-819, December.
    9. J.B.G. Frenk & G. Kassay & J. Kolumbán, 2002. "Equivalent Results in MinimaxTheory," Tinbergen Institute Discussion Papers 02-009/4, Tinbergen Institute.
    10. Yogendra Pandey & S. K. Mishra, 2018. "Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators," Annals of Operations Research, Springer, vol. 269(1), pages 549-564, October.
    11. Alberto Ramos, 2019. "Two New Weak Constraint Qualifications for Mathematical Programs with Equilibrium Constraints and Applications," Journal of Optimization Theory and Applications, Springer, vol. 183(2), pages 566-591, November.
    12. Jiawei Chen & Elisabeth Köbis & Jen-Chih Yao, 2019. "Optimality Conditions and Duality for Robust Nonsmooth Multiobjective Optimization Problems with Constraints," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 411-436, May.
    13. Yogendra Pandey & Shashi Kant Mishra, 2016. "Duality for Nonsmooth Optimization Problems with Equilibrium Constraints, Using Convexificators," Journal of Optimization Theory and Applications, Springer, vol. 171(2), pages 694-707, November.

    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:jglopt:v:65:y:2016:i:3:d:10.1007_s10898-015-0379-z. 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.