IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v104y2000i1d10.1023_a1004628822745.html
   My bibliography  Save this article

Local Convexification of the Lagrangian Function in Nonconvex Optimization

Author

Listed:
  • D. Li

    (Chinese University of Hong Kong)

  • X. L. Sun

    (Shanghai University, Jiading)

Abstract

It is well-known that a basic requirement for the development of local duality theory in nonconvex optimization is the local convexity of the Lagrangian function. This paper shows how to locally convexify the Lagrangian function and thus expand the class of optimization problems to which dual methods can be applied. Specifically, we prove that, under mild assumptions, the Hessian of the Lagrangian in some transformed equivalent problem formulations becomes positive definite in a neighborhood of a local optimal point of the original problem.

Suggested Citation

  • D. Li & X. L. Sun, 2000. "Local Convexification of the Lagrangian Function in Nonconvex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 104(1), pages 109-120, January.
    • Handle: RePEc:spr:joptap:v:104:y:2000:i:1:d:10.1023_a:1004628822745
    DOI: 10.1023/A:1004628822745
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1004628822745
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1004628822745?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. Z. K. Xu, 1997. "Local Saddle Points and Convexification for Nonconvex Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 94(3), pages 739-746, September.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. H. Z. Luo & G. Mastroeni & H. X. Wu, 2010. "Separation Approach for Augmented Lagrangians in Constrained Nonconvex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 144(2), pages 275-290, February.
    2. Qian Liu & Wan Tang & Xin Yang, 2009. "Properties of saddle points for generalized augmented Lagrangian," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 69(1), pages 111-124, March.

    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. M. V. Dolgopolik, 2018. "Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property," Journal of Global Optimization, Springer, vol. 71(2), pages 237-296, June.
    2. H. Wu & H. Luo, 2012. "Saddle points of general augmented Lagrangians for constrained nonconvex optimization," Journal of Global Optimization, Springer, vol. 53(4), pages 683-697, August.
    3. Francisco Guerra-Vázquez & Jan-J. Rückmann & Ralf Werner, 2012. "On saddle points in nonconvex semi-infinite programming," Journal of Global Optimization, Springer, vol. 54(3), pages 433-447, November.
    4. Xiaoling Sun & Duan Li, 2000. "Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation," Mathematics of Operations Research, INFORMS, vol. 25(4), pages 625-644, 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:joptap:v:104:y:2000:i:1:d:10.1023_a:1004628822745. 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.