A polynomial arc-search interior-point algorithm for linear programming (Q378268): Difference between revisions

The author develops a competitive arc-feasible infeasible interior-point algorithm. He shows that based on the results on Netlib problems, the comparison of Mehrotra's algorithm and the arc-feasible infeasible interior-point algorithm yields that the proposed arc-feasible infeasible interior-point algorithm is a more reliable and efficient algorithm than Mehrotra's algorithm. This article is well written, structured and explained, it contains six sections: Section 1 on Introduction, Section 2 on Problem descriptions, Section 3 on Arc-search algorithm for linear programming, Section 4 on Implementation details, Section 5 on Numerical tests, and, Section 6 on Conclusions.