An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations
暂无分享,去创建一个
[1] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[2] R. Kellogg,et al. Pathways to solutions, fixed points, and equilibria , 1983 .
[3] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[4] Michael A. Saunders,et al. On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..
[5] Pravin M. Vaidya,et al. An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations , 1987, Math. Program..
[6] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[7] D. Bayer,et al. The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories , 1989 .