An ${\cal O}(nL)$ Infeasible-Interior-Point Algorithm for Linear Programming
Optimization and Control
2018-05-24 v2
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 which is at least as good as the best existing bound for infeasible-interior-point algorithms for linear programming.
Cite
@article{arxiv.1506.06365,
title = {An ${\cal O}(nL)$ Infeasible-Interior-Point Algorithm for Linear Programming},
author = {Yaguang Yang and Makoto Yamashita},
journal= {arXiv preprint arXiv:1506.06365},
year = {2018}
}
Comments
12 pages