IDEAS home Printed from https://ideas.repec.org/a/wly/jnlaaa/v2014y2014i1n436415.html

A QP‐Free Algorithm for Finite Minimax Problems

Author

Listed:
  • Daolan Han
  • Jinbao Jian
  • Qinfeng Zhang

Abstract

The nonlinear minimax problems without constraints are discussed. Due to the expensive computation for solving QP subproblems with inequality constraints of SQP algorithms, in this paper, a QP‐free algorithm which is also called sequential systems of linear equations algorithm is presented. At each iteration, only two systems of linear equations with the same coefficient matrix need to be solved, and the dimension of each subproblem is not of full dimension. The proposed algorithm does not need any penalty parameters and barrier parameters, and it has small computation cost. In addition, the parameters in the proposed algorithm are few, and the stability of the algorithm is well. Convergence property is described and some numerical results are provided.

Suggested Citation

  • Daolan Han & Jinbao Jian & Qinfeng Zhang, 2014. "A QP‐Free Algorithm for Finite Minimax Problems," Abstract and Applied Analysis, John Wiley & Sons, vol. 2014(1).
    • Handle: RePEc:wly:jnlaaa:v:2014:y:2014:i:1:n:436415
    DOI: 10.1155/2014/436415
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/436415
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/436415?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
    ---><---

    References listed on IDEAS

    as
    1. F. Guerra Vazquez & H. Günzel & H.Th. Jongen, 2001. "On Logarithmic Smoothing of the Maximum Function," Annals of Operations Research, Springer, vol. 101(1), pages 209-220, January.
    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. E. Polak & J. O. Royset & R. S. Womersley, 2003. "Algorithms with Adaptive Smoothing for Finite Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 119(3), pages 459-484, December.

    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:wly:jnlaaa:v:2014:y:2014:i:1:n:436415. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4058 .

    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.