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

Solving Nonlinear Programming Problems with Noisy Function Values and Noisy Gradients

Author

Listed:
  • M. Hintermüller

    (University of Graz)

Abstract

An efficient algorithm for solving nonlinear programs with noisy equality constraints is introduced and analyzed. The unknown exact constraints are replaced by surrogates based on the bundle idea, a well-known strategy from nonsmooth optimization. This concept allows us to perform a fast computation of the surrogates by solving simple quadratic optimization problems, control the memory needed by the algorithm, and prove the differentiability properties of the surrogate functions. The latter aspect allows us to invoke a sequential quadratic programming method. The overall algorithm is of the quasi-Newton type. Besides convergence theorems, qualification results are given and numerical test runs are discussed.

Suggested Citation

  • M. Hintermüller, 2002. "Solving Nonlinear Programming Problems with Noisy Function Values and Noisy Gradients," Journal of Optimization Theory and Applications, Springer, vol. 114(1), pages 133-169, July.
    • Handle: RePEc:spr:joptap:v:114:y:2002:i:1:d:10.1023_a:1015416221909
    DOI: 10.1023/A:1015416221909
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1015416221909
    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:1015416221909?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.

    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:114:y:2002:i:1:d:10.1023_a:1015416221909. 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.