IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v145y2010i2d10.1007_s10957-009-9634-0.html
   My bibliography  Save this article

Improved Full-Newton Step O(nL) Infeasible Interior-Point Method for Linear Optimization

Author

Listed:
  • G. Gu

    (Delft University of Technology)

  • H. Mansouri

    (Shahrekord University)

  • M. Zangiabadi

    (Shahrekord University)

  • Y. Q. Bai

    (Shanghai University)

  • C. Roos

    (Delft University of Technology)

Abstract

We present several improvements of the full-Newton step infeasible interior-point method for linear optimization introduced by Roos (SIAM J. Optim. 16(4):1110–1136, 2006). Each main step of the method consists of a feasibility step and several centering steps. We use a more natural feasibility step, which targets the μ +-center of the next pair of perturbed problems. As for the centering steps, we apply a sharper quadratic convergence result, which leads to a slightly wider neighborhood for the feasibility steps. Moreover, the analysis is much simplified and the iteration bound is slightly better.

Suggested Citation

  • G. Gu & H. Mansouri & M. Zangiabadi & Y. Q. Bai & C. Roos, 2010. "Improved Full-Newton Step O(nL) Infeasible Interior-Point Method for Linear Optimization," Journal of Optimization Theory and Applications, Springer, vol. 145(2), pages 271-288, May.
    • Handle: RePEc:spr:joptap:v:145:y:2010:i:2:d:10.1007_s10957-009-9634-0
    DOI: 10.1007/s10957-009-9634-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-009-9634-0
    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-009-9634-0?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. Xiaoni Chi & Guoqiang Wang, 2021. "A Full-Newton Step Infeasible Interior-Point Method for the Special Weighted Linear Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 108-129, July.
    2. G. Q. Wang & Y. Q. Bai & X. Y. Gao & D. Z. Wang, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Interior-Point Methods for Semidefinite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 242-262, April.
    3. Behrouz Kheirfam, 2014. "A New Complexity Analysis for Full-Newton Step Infeasible Interior-Point Algorithm for Horizontal Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 161(3), pages 853-869, June.
    4. H. Mansouri & M. Zangiabadi & M. Arzani, 2015. "A Modified Infeasible-Interior-Point Algorithm for Linear Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 605-618, August.
    5. G. Q. Wang & L. C. Kong & J. Y. Tao & G. Lesaja, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Feasible Interior-Point Method for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 588-604, August.
    6. Alireza Asadi & Cornelis Roos, 2016. "Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood," Journal of Optimization Theory and Applications, Springer, vol. 170(2), pages 562-590, August.

    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:145:y:2010:i:2:d:10.1007_s10957-009-9634-0. 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.