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

Nonmonotone Line Search Algorithm for Constrained Minimax Problems

Author

Listed:
  • Y.H. Yu

    (Peking University)

  • L. Gao

    (Peking University)

Abstract

In this paper, an algorithm for constrained minimax problems is presented which is globally convergent and whose rate of convergence is two-step superlinear. The algorithm applies SQP to the constrained minimax problems by combining a nonmonotone line search and a second-order correction technique, which guarantees a full steplength while close to a solution, such that the Maratos effect is avoided and two-step superlinear convergence is achieved.

Suggested Citation

  • Y.H. Yu & L. Gao, 2002. "Nonmonotone Line Search Algorithm for Constrained Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 115(2), pages 419-446, November.
  • Handle: RePEc:spr:joptap:v:115:y:2002:i:2:d:10.1023_a:1020896407415
    DOI: 10.1023/A:1020896407415
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jin-bao Jian & Qing-juan Hu & Chun-ming Tang, 2014. "Superlinearly Convergent Norm-Relaxed SQP Method Based on Active Set Identification and New Line Search for Constrained Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 859-883, December.
    2. Ping Hu & Xu-Qing Liu, 2013. "A Nonmonotone Line Search Slackness Technique for Unconstrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 773-786, September.
    3. Fusheng Wang, 2013. "A hybrid algorithm for linearly constrained minimax problems," Annals of Operations Research, Springer, vol. 206(1), pages 501-525, July.

    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:115:y:2002:i:2:d:10.1023_a:1020896407415. 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.