IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/293475.html
   My bibliography  Save this article

Improved Filter-SQP Algorithm with Active Set for Constrained Minimax Problems

Author

Listed:
  • Zhijun Luo
  • Lirong Wang

Abstract

An improved filter-SQP algorithm with active set for constrained finite minimax problems is proposed. Firstly, an active constraint subset is obtained by a pivoting operation procedure. Then, a new quadratic programming (QP) subproblem is constructed based on the active constraint subset. The main search direction is obtained by solving this (QP) subproblem which is feasible at per iteration point and need not to consider the penalty function by using the filter technique. Under some suitable conditions, the global convergence of our algorithm is established. Finally, some numerical results are reported to show the effectiveness of the proposed algorithm.

Suggested Citation

  • Zhijun Luo & Lirong Wang, 2014. "Improved Filter-SQP Algorithm with Active Set for Constrained Minimax Problems," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-7, September.
    • Handle: RePEc:hin:jnljam:293475
    DOI: 10.1155/2014/293475
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2014/293475.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/JAM/2014/293475.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/293475?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
    ---><---

    More about this item

    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:hin:jnljam:293475. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.