IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-68874-4_5.html
   My bibliography  Save this book chapter

Penalty Functions

In: Mathematical Programming The State of the Art

Author

Listed:
  • R. Fletcher

    (University of Dundee, Mathematics Department)

Abstract

This state of the art review starts with a discussion of the classical (Courant) penalty function and of the various theoretical results which can be proved. The function is used sequentially and numerical results are disappointing; the reasons for this are explained, and cannot be alleviated by extrapolation. These difficulties are apparently overcome by using the multiplier (augmented Lagrangian) penalty function, and the theoretical background and practical possibilities are described. However the current approach for forcing convergence has its disadvantages and there is scope for more research. Most interest currently centres on exact penalty functions, and in particular the l 1 exact penalty function. This is a nonsmooth function so cannot be minimized adequately by current techniques for smooth functions. However it is very useful as a criterion function in association with other techniques such as sequential QP. A thorough description of the l 1 penalty function is given, which aims to clarify the first and second order conditions associated with the minimizing point. There are some disadvantages of using non-smooth penalty functions including the existence of curved grooves which can be difficult to follow, and the possibility of the Maratos effect occurring. Suggestions for alleviating these difficulties are discussed. These effects have recently caused more emphasis in the search for suitable smooth exact penalty functions, and a survey of research in this area, and the theoretical and practical possibilities, is given. Finally some of the many other ideas for penalty functions are discussed briefly.

Suggested Citation

  • R. Fletcher, 1983. "Penalty Functions," Springer Books, in: Achim Bachem & Bernhard Korte & Martin Grötschel (ed.), Mathematical Programming The State of the Art, pages 87-114, Springer.
  • Handle: RePEc:spr:sprchp:978-3-642-68874-4_5
    DOI: 10.1007/978-3-642-68874-4_5
    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-642-68874-4_5. 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.