An improved version of Chubanov's method for solving a homogeneous feasibility problem
暂无分享,去创建一个
[1] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[2] Aharon Ben-Tal,et al. Lectures on modern convex optimization , 1987 .
[3] 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..
[4] Takashi Tsuchiya,et al. An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming , 2016, Optim. Methods Softw..
[5] T. Terlaky,et al. A Polynomial Column-wise Rescaling von Neumann Algorithm , 2015 .
[6] Kees Roos,et al. On Chubanov’s Method for Solving a Homogeneous Inequality System , 2015 .
[7] Erich Stiemke. Über positive Lösungen homogener linearer Gleichungen , 1915 .
[8] Javier Peña,et al. Solving Conic Systems via Projection and Rescaling , 2015, Math. Program..
[9] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[10] T. Terlaky,et al. The Duality Between the Perceptron Algorithm and the von Neumann Algorithm , 2013 .
[11] Robert H. Halstead,et al. Matrix Computations , 2011, Encyclopedia of Parallel Computing.
[12] Sergei Chubanov,et al. A polynomial projection algorithm for linear feasibility problems , 2015, Math. Program..
[13] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[14] J. Edmonds. Systems of distinct representatives and linear algebra , 1967 .
[15] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[16] Bruno F. Lourenço,et al. An extension of Chubanov’s algorithm to symmetric cones , 2017, Mathematical Programming.
[17] G. Grammin. Polynomial-time Algorithm , 1984 .