Arc-Search Infeasible Interior-Point Algorithm for Linear Programming

Abstract

Mehrotra's algorithm has been the most successful infeasible interior-point algorithm for linear programming since 1990. Most popular interior-point software packages for linear programming are based on Mehrotra's algorithm. This paper proposes an alternative algorithm, arc-search infeasible interior-point algorithm. We will demonstrate, by testing Netlib problems and comparing the test results obtained by arc-search infeasible interior-point algorithm and Mehrotra's algorithm, that the proposed arc-search infeasible interior-point algorithm is a more efficient algorithm than Mehrotra's algorithm.

Cited by in corpus (5)

• An $\mathcal{O}(nL)$ Infeasible-Interior-Point Algorithm for Linear Programming
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
• An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
• A polynomial time infeasible interior-point arc-search algorithm for convex optimization
• Constrained LQR Design Using Interior-Point Arc-Search Method for Convex Quadratic Programming with Box Constraints