On Chubanov’s Method for Solving a Homogeneous Inequality System
暂无分享,去创建一个
[1] Erich Stiemke. Über positive Lösungen homogener linearer Gleichungen , 1915 .
[2] Sergei Chubanov. A strongly polynomial algorithm for linear systems having a binary solution , 2012, Math. Program..
[3] Sergei Chubanov. A polynomial relaxation-type algorithm for linear programming , 2011 .
[4] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[5] C. G. Broyden. A simple algebraic proof of Farkas's lemma and related theorems , 1998 .
[6] J. Edmonds. Systems of distinct representatives and linear algebra , 1967 .
[7] T. Terlaky,et al. The Duality Between the Perceptron Algorithm and the von Neumann Algorithm , 2013 .
[8] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[9] Sergei Chubanov. A polynomial projection algorithm for linear programming , 2013 .
[10] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[11] Gene H. Golub,et al. Matrix computations , 1983 .
[12] Jos F. Sturm,et al. A Matlab toolbox for optimization over symmetric cones , 1999 .
[13] Robert M. Freund,et al. Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system , 2000, Math. Program..
[14] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .