@Article{JCM-23-1,
author = {},
title = {Expected Number of Iterations of Interior-Point Algorithms for Linear Programming},
journal = {Journal of Computational Mathematics},
year = {2005},
volume = {23},
number = {1},
pages = {93--100},
abstract = {<p style="text-align: justify;">We study the behavior of some polynomial interior-point algorithms for solving random linear programming (LP) problems. We show that the expected and anticipated number of iterations of these algorithms is bounded above by $O(n^{1.5})$. The random LP problem is Todd&#39;s probabilistic model with the Cauchy distribution.</p>},
issn = {1991-7139},
doi = {https://doi.org/2005-JCM-8799},
url = {https://global-sci.com/article/85130/expected-number-of-iterations-of-interior-point-algorithms-for-linear-programming}
}