论文信息 - Average number of iterations of some polynomial interior-point

Average number of iterations of some polynomial interior-point

We study the behavior of some polynomial interior-point algorithms for solving random linear programming (LP) problems. We show that the average number of iterations of these algorithms, coupled with a finite termination technique, is bounded above byO(n1.5). The random LP problem is Todd’s probabilistic model with the standard Gauss distribution.

Siming Huang

[1] Richard M. Karp,et al. A simplex variant solving an m times d linear program in O(min(m2, d2) expected number of pivot steps , 1987, J. Complex..

[2] Yinyu Ye,et al. Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming , 1999, Math. Oper. Res..

[3] Shinji Mizuno,et al. An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems , 1991, Math. Program..

[4] Nimrod Megiddo,et al. A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension , 1985, JACM.

[5] Michael J. Todd,et al. Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems , 1986, Math. Program..

[6] K. Borgwardt. The Simplex Method , 1987 .

[7] Yinyu Ye,et al. Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming , 1994, Math. Oper. Res..

[8] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..

[9] Florian A. Potra,et al. Average Performance of a Self–Dual Interior Point Algorithm for Linear Programming , 1993 .

[10] Michael J. Todd,et al. Probabilistic Models for Linear Programming , 1991, Math. Oper. Res..

[11] Stephen Smale,et al. On the average number of steps of the simplex method of linear programming , 1983, Math. Program..