IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v149y2011i2d10.1007_s10957-010-9790-2.html
   My bibliography  Save this article

Switching Stepsize Strategies for Sequential Quadratic Programming

Author

Listed:
  • George Tzallas-Regas

    (Imperial College London)

  • Berç Rustem

    (Imperial College London)

Abstract

A Sequential Quadratic Programming (in short, SQP) algorithm is presented for solving constrained nonlinear programming problems. The algorithm uses three stepsize strategies, in order to achieve global and superlinear convergence. Switching rules are implemented that combine the merits and avoid the drawbacks of the three stepsize strategies. A penalty parameter is determined, using an adaptive strategy that aims to achieve sufficient decrease of the activated merit function. Global convergence is established and it is also shown that, locally, unity step sizes are accepted. Therefore, superlinear convergence is not impeded under standard assumptions. Global convergence and convergence of the stepsizes are displayed on test problems from the Hock and Schittkowski collection.

Suggested Citation

  • George Tzallas-Regas & Berç Rustem, 2011. "Switching Stepsize Strategies for Sequential Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 149(2), pages 269-292, May.
    • Handle: RePEc:spr:joptap:v:149:y:2011:i:2:d:10.1007_s10957-010-9790-2
    DOI: 10.1007/s10957-010-9790-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-010-9790-2
    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/s10957-010-9790-2?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. S.-P. Han, 1986. "On the Augmented Lagrangian," Mathematics of Operations Research, INFORMS, vol. 11(1), pages 161-168, February.
    Full references (including those not matched with items on IDEAS)

    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. Terry-Leigh Oliphant & M. Montaz Ali, 2018. "A trajectory-based method for mixed integer nonlinear programming problems," Journal of Global Optimization, Springer, vol. 70(3), pages 601-623, March.
    2. M. Montaz Ali & Terry-Leigh Oliphant, 2018. "A Trajectory-Based Method for Constrained Nonlinear Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 177(2), pages 479-497, May.

    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:149:y:2011:i:2:d:10.1007_s10957-010-9790-2. 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.