An {cal O}(nL) Infeasible-Interior-Point Algorithm for Linear Programming
classification
🧮 math.OC
keywords
algorithminfeasible-interior-pointboundlinearpolynomialprogrammingalgorithmsarc-search
read the original 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 ${\cal O}(nL)$ which is at least as good as the best existing bound for infeasible-interior-point algorithms for linear programming.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.