IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v63y2016i3d10.1007_s10589-015-9793-x.html
   My bibliography  Save this article

On an inexact trust-region SQP-filter method for constrained nonlinear optimization

Author

Listed:
  • Andrea Walther

    (Universität Paderborn)

  • Lorenz Biegler

    (Carnegie Mellon University)

Abstract

A class of trust-region algorithms is developed and analyzed for the solution of optimization problems with nonlinear equality and inequality constraints. These algorithms are developed for problem classes where the constraints are not available in an open, equation-based form, and constraint Jacobians are of high dimension and are expensive to calculate. Based on composite-step trust region methods and a filter approach, the resulting algorithms do not require the computation of exact Jacobians; only Jacobian vector products are used along with approximate Jacobian matrices. With these modifications, we show that the algorithm is globally convergent. Also, as demonstrated on numerical examples, our algorithm avoids direct computation of exact Jacobians and has significant potential benefits on problems where Jacobian calculations are expensive.

Suggested Citation

  • Andrea Walther & Lorenz Biegler, 2016. "On an inexact trust-region SQP-filter method for constrained nonlinear optimization," Computational Optimization and Applications, Springer, vol. 63(3), pages 613-638, April.
  • Handle: RePEc:spr:coopap:v:63:y:2016:i:3:d:10.1007_s10589-015-9793-x
    DOI: 10.1007/s10589-015-9793-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-015-9793-x
    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/s10589-015-9793-x?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:coopap:v:63:y:2016:i:3:d:10.1007_s10589-015-9793-x. 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.