An 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 O(nL) which is at least as good as the best existing bound for infeasible-interior-point algorithms for linear programming.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.