IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v135y2007i3d10.1007_s10957-007-9264-3.html
   My bibliography  Save this article

Convergence Analysis of an Inexact Potential Reduction Method for Convex Quadratic Programming

Author

Listed:
  • S. Cafieri

    (2nd University of Naples)

  • M. D’Apuzzo

    (2nd University of Naples)

  • V. Simone

    (2nd University of Naples)

  • D. Serafino

    (2nd University of Naples)

  • G. Toraldo

    (University of Naples Federico II)

Abstract

We analyze the convergence of an infeasible inexact potential reduction method for quadratic programming problems. We show that the convergence of this method is achieved if the residual of the KKT system satisfies a bound related to the duality gap. This result suggests stopping criteria for inner iterations that can be used to adapt the accuracy of the computed direction to the quality of the potential reduction iterate in order to achieve computational efficiency.

Suggested Citation

  • S. Cafieri & M. D’Apuzzo & V. Simone & D. Serafino & G. Toraldo, 2007. "Convergence Analysis of an Inexact Potential Reduction Method for Convex Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 355-366, December.
  • Handle: RePEc:spr:joptap:v:135:y:2007:i:3:d:10.1007_s10957-007-9264-3
    DOI: 10.1007/s10957-007-9264-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-007-9264-3
    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-007-9264-3?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. Cafieri & M. D’Apuzzo & M. Marino & A. Mucherino & G. Toraldo, 2006. "Interior-Point Solver for Large-Scale Quadratic Programming Problems with Bound Constraints," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 55-75, April.
    2. Michael J. Todd & Yinyu Ye, 1990. "A Centered Projective Algorithm for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 15(3), pages 508-529, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Kuo-Ling Huang & Sanjay Mehrotra, 2017. "Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 36-53, February.
    2. Marco Viola & Mara Sangiovanni & Gerardo Toraldo & Mario R. Guarracino, 2019. "Semi-supervised generalized eigenvalues classification," Annals of Operations Research, Springer, vol. 276(1), pages 249-266, May.

    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. Cosmin Petra & Mihai Anitescu, 2012. "A preconditioning technique for Schur complement systems arising in stochastic optimization," Computational Optimization and Applications, Springer, vol. 52(2), pages 315-344, June.
    2. Reha H. Tütüncü, 2000. "A Primal-Dual Variant of the IRI-IMAI Algorithm for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 25(2), pages 195-213, May.
    3. Bosch, Ronald J. & Ye, Yinyu & Woodworth, George G., 1995. "A convergent algorithm for quantile regression with smoothing splines," Computational Statistics & Data Analysis, Elsevier, vol. 19(6), pages 613-630, June.
    4. Zhongyi Liu & Yue Chen & Wenyu Sun & Zhihui Wei, 2012. "A Predictor-corrector algorithm with multiple corrections for convex quadratic programming," Computational Optimization and Applications, Springer, vol. 52(2), pages 373-391, June.
    5. Liqun Qi & Zheng-Hai Huang, 2019. "Tensor Complementarity Problems—Part II: Solution Methods," Journal of Optimization Theory and Applications, Springer, vol. 183(2), pages 365-385, November.
    6. S. Cafieri & M. D’Apuzzo & M. Marino & A. Mucherino & G. Toraldo, 2006. "Interior-Point Solver for Large-Scale Quadratic Programming Problems with Bound Constraints," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 55-75, April.
    7. Kuo-Ling Huang & Sanjay Mehrotra, 2017. "Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 36-53, February.

    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:135:y:2007:i:3:d:10.1007_s10957-007-9264-3. 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.