A Short-Cut Potential Reduction Algorithm for Linear Programming
暂无分享,去创建一个
[1] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..
[2] Yinyu Ye,et al. On the finite convergence of interior-point algorithms for linear programming , 1992, Math. Program..
[3] G. Dantzig,et al. A Build-Up Interior Method for Linear Programming: Affine Scaling Form , 1990 .
[4] Yinyu Ye,et al. An O(n3L) potential reduction algorithm for linear programming , 1991, Math. Program..
[5] E. Weintraub,et al. Recent Developments and New Directions , 1974 .
[6] C. C. Gonzaga,et al. An algorithm for solving linear programming programs in O(n3L) operations , 1988 .
[7] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[8] Robert M. Freund,et al. Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function , 1991, Math. Program..
[9] Mauricio G. C. Resende,et al. An implementation of Karmarkar's algorithm for linear programming , 1989, Math. Program..
[10] Kaoru Tone,et al. An active-set strategy in an interior point method for linear programming , 1991, Math. Program..
[11] R. C. Monteiro,et al. Interior path following primal-dual algorithms , 1988 .
[12] A. Charnes. Optimality and Degeneracy in Linear Programming , 1952 .
[13] Shinji Mizuno,et al. A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..
[14] A. Mcintosh. Fitting Linear Models: An Application of Conjugate Gradient Algorithms , 1982 .