New efficient descent direction of a primal-dual path-following algorithm for linear programming

Authors

  • Billel Zaoui Ferhat abbas Setif-1- University
  • Djamel Benterki
  • Samia Khelladi

DOI:

https://doi.org/10.19139/soic-2310-5070-1748

Keywords:

Linear programming, Interior-point methods, Primal- dual algorithm, Descent direction

Abstract

We introduce a new primal-dual interior-point algorithm with a full-Newton step for solving linear optimization problems. The newly proposed approach is based on applying a new function on a simple equivalent form of the centering equation of the system, which defines the central path. Thus, we get a new efficient search direction for the considered algorithm. Moreover, we prove that the method solves the studied problems in polynomial time and that the algorithm obtained has the best known complexity bound for linear optimization. Finally, a comparative numerical study is reported to show the efficiency of the proposed algorithm.

Downloads

Published

2024-02-25

How to Cite

Zaoui, B., Benterki, D., & Khelladi, S. (2024). New efficient descent direction of a primal-dual path-following algorithm for linear programming. Statistics, Optimization & Information Computing, 12(4), 1076–1090. https://doi.org/10.19139/soic-2310-5070-1748

Issue

Vol. 12 No. 4 (2024)

Section

Research Articles

License

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
    2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
    3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).