IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v88y2024i2d10.1007_s10589-024-00561-z.html
   My bibliography  Save this article

An infeasible interior-point arc-search method with Nesterov’s restarting strategy for linear programming problems

Author

Listed:
  • Einosuke Iida

    (Tokyo Institute of Technology)

  • Makoto Yamashita

    (Tokyo Institute of Technology)

Abstract

An arc-search interior-point method is a type of interior-point method that approximates the central path by an ellipsoidal arc, and it can often reduce the number of iterations. In this work, to further reduce the number of iterations and the computation time for solving linear programming problems, we propose two arc-search interior-point methods using Nesterov’s restarting strategy which is a well-known method to accelerate the gradient method with a momentum term. The first one generates a sequence of iterations in the neighborhood, and we prove that the proposed method converges to an optimal solution and that it is a polynomial-time method. The second one incorporates the concept of the Mehrotra-type interior-point method to improve numerical performance. The numerical experiments demonstrate that the second one reduced the number of iterations and the computational time compared to existing interior-point methods due to the momentum term.

Suggested Citation

  • Einosuke Iida & Makoto Yamashita, 2024. "An infeasible interior-point arc-search method with Nesterov’s restarting strategy for linear programming problems," Computational Optimization and Applications, Springer, vol. 88(2), pages 643-676, June.
    • Handle: RePEc:spr:coopap:v:88:y:2024:i:2:d:10.1007_s10589-024-00561-z
    DOI: 10.1007/s10589-024-00561-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-024-00561-z
    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/s10589-024-00561-z?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.

    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:coopap:v:88:y:2024:i:2:d:10.1007_s10589-024-00561-z. 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.