On the number of iterations of Karmarkar's algorithm for linear programming
暂无分享,去创建一个
[1] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[2] Michael A. Saunders,et al. On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..
[3] Mauricio G. C. Resende,et al. An implementation of Karmarkar's algorithm for linear programming , 1989, Math. Program..
[4] M. Powell. Karmarkar's algorithm : a view from nonlinear programming , 1989 .
[5] Nimrod Megiddo,et al. Boundary Behavior of Interior Point Algorithms in Linear Programming , 1989, Math. Oper. Res..
[6] Clóvis C. Gonzaga,et al. Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method , 1991, SIAM J. Optim..
[7] Kurt M. Anstreicher,et al. On the Performance of Karmarkar's Algorithm over a Sequence of Iterations , 1991, SIAM J. Optim..
[8] Yinyu Ye,et al. Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program , 1991, Oper. Res. Lett..
[9] I. Lustig,et al. Computational experience with a primal-dual interior point method for linear programming , 1991 .
[10] Clóvis C. Gonzaga,et al. Interior point algorithms for linear programming with inequality constraints , 1991, Math. Program..