On the Average Condition of Random Linear Programs
暂无分享,去创建一个
[1] Felipe Cucker,et al. Solving linear programs with finite precision: I. Condition numbers and random programs , 2004, Math. Program..
[2] Felipe Cucker,et al. Smoothed Analysis of Moore-Penrose Inversion , 2010, SIAM J. Matrix Anal. Appl..
[3] J. Demmel. The Probability That a Numerical, Analysis Problem Is Difficult , 2013 .
[4] A. Turing. ROUNDING-OFF ERRORS IN MATRIX PROCESSES , 1948 .
[5] James Renegar,et al. Is It Possible to Know a Problem Instance Is Ill-Posed?: Some Foundations for a General Theory of Condition Numbers , 1994, J. Complex..
[6] J. Neumann,et al. Numerical inverting of matrices of high order , 1947 .
[7] Felipe Cucker,et al. A new condition number for linear programming , 2001, Math. Program..
[8] John Dunagan,et al. Smoothed analysis of condition numbers and complexity implications for linear programming , 2011, Math. Program..
[9] Felipe Cucker,et al. On the Expected Condition Number of Linear Programming Problems , 2003, Numerische Mathematik.
[10] Steve Smale,et al. Complexity theory and numerical analysis , 1997, Acta Numerica.
[11] J. Neumann,et al. Numerical inverting of matrices of high order. II , 1951 .
[12] Felipe Cucker,et al. Solving linear programs with finite precision: II. Algorithms , 2006, J. Complex..
[13] Felipe Cucker,et al. A note on level-2 condition numbers , 2005, J. Complex..
[14] F. Cucker,et al. Coverage processes on spheres and condition numbers for linear programming , 2007, 0712.2816.
[15] Jorge R. Vera,et al. On the complexity of linear programming under finite precision arithmetic , 1998, Math. Program..