IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-662-47044-2_9.html
   My bibliography  Save this book chapter

Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming

In: Optimization Methods, Theory and Applications

Author

Listed:
  • S. Deng

    (Northern Illinois University, Department of Mathematical Sciences)

Abstract

The regularization of a nonlinear program is exact if all solutions of the regularized problem are also solutions of the original problem for all values of the regularization parameter below some positive threshold. In Deng (Pac J Optim 8(1):27–32, 2012), we show that, for a given nonlinear program, the regularization is exact if and only if the Lagrangian function of a certain selection problem has a saddle point, and the regularization parameter threshold is inversely related to the Lagrange multiplier associated with the saddle point. The results in Deng (Pac J Optim 8(1):27–32, 2012) not only provide a fresh perspective on exact regularization but also extend the main results in Friedlander and Tseng (SIAM J Optim 18:1326–1350, 2007) on a characterization of exact regularization of a convex program to that of a nonlinear (not necessarily convex) program. In this paper, we will examine inner-connections among exact regularization, normal cone identity, and the existence of a weak sharp minimum for certain associated nonlinear programs. Along the way, we illustrate by examples, how to obtain both new results and reproduce many existing results from a fresh perspective.

Suggested Citation

  • S. Deng, 2015. "Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming," Springer Books, in: Honglei Xu & Song Wang & Soon-Yi Wu (ed.), Optimization Methods, Theory and Applications, edition 127, chapter 0, pages 175-182, Springer.
    • Handle: RePEc:spr:sprchp:978-3-662-47044-2_9
    DOI: 10.1007/978-3-662-47044-2_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:sprchp:978-3-662-47044-2_9. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.