On the probabilistic complexity of finding an approximate solution for linear programming
暂无分享,去创建一个
Jun Ji | Florian A. Potra | F. Potra | J. Ji
[1] Shinji Mizuno,et al. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..
[2] F. Downton,et al. Introduction to Mathematical Statistics , 1959 .
[3] P. Pardalos. Complexity in numerical optimization , 1993 .
[4] Stephen Smale,et al. On the average number of steps of the simplex method of linear programming , 1983, Math. Program..
[5] Florian A. Potra,et al. Average Performance of a Self–Dual Interior Point Algorithm for Linear Programming , 1993 .
[6] Michael J. Todd,et al. A Centered Projective Algorithm for Linear Programming , 1990, Math. Oper. Res..
[7] Petra Huhn,et al. Interior-Point Methods: Worst Case and Average Case Analysis of a Phase-I Algorithm and a Termination Procedure , 2002, J. Complex..
[8] Yinyu Ye,et al. Convergence behavior of interior-point algorithms , 1993, Math. Program..
[9] Yinyu Ye,et al. Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming , 1999, Math. Oper. Res..
[10] Petra Huhn,et al. An Upper Bound for the Average Number of Iterations Required in Phase II of an Interior-Point-Method , 1998 .
[11] Robert V. Hogg,et al. Introduction to Mathematical Statistics. , 1966 .
[12] Yinyu Ye,et al. A primal-dual interior point method whose running time depends only on the constraint matrix , 1996, Math. Program..
[13] Michael J. Todd,et al. Probabilistic Models for Linear Programming , 1991, Math. Oper. Res..
[14] Henryk Wozniakowski,et al. Complexity of linear programming , 1982, Oper. Res. Lett..
[15] Renato D. C. Monteiro,et al. Limiting behavior of the affine scaling continuous trajectories for linear programming problems , 1991, Math. Program..
[16] Michael J. Todd,et al. Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems , 2001, Math. Program..
[17] Yinyu Ye,et al. Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming , 1994, Math. Oper. Res..
[18] K. Borgwardt. A Sharp Upper Bound for the Expected Number of Shadow Vertices in Lp-Polyhedra Under Orthogonal Projection on Two-Dimensional Planes , 1999 .
[19] Siming Huang. Average number of iterations of some polynomial interior-point , 2000 .
[20] Yin Zhang,et al. A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming , 1993, Math. Program..