An $\mathcal{O}(nL)$ Infeasible-Interior-Point Algorithm for Linear Programming

Abstract

In this paper, we propose an arc-search infeasible-interior-point algorithm. We show that this algorithm is polynomial and the polynomial bound is $\mathcal{O}(nL)$ which is at least as good as the best existing bound for infeasible-interior-point algorithms for linear programming.

12 pages

References in corpus (2)

• An Analytic Solution to Wahba's Problem
• Arc-Search Infeasible Interior-Point Algorithm for Linear Programming

Cited by in corpus (4)

• 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