摘要: In this paper a unified treatment of algorithms is described for linear programming methods based on the central path. This path curve along which cost decreases, and that stays always far...
acm.org
sci-hub.se 参考文章(44)
Gy. Sonnevend, An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming System Modelling and Optimization. ,vol. 84, pp. 866- 875 ,(1986) , 10.1007/BFB0043914
J. L. Goffin, Affine and projective transformations in nondifferentiable optimization Trends in Mathematical Optimization. pp. 79- 91 ,(1988) , 10.1007/978-3-0348-9297-1_6
E. Polak, Computational methods in optimization ,(1971)
Gy. Sonnevend, New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation Trends in Mathematical Optimization. pp. 311- 326 ,(1988) , 10.1007/978-3-0348-9297-1_20
Clovis C. Gonzaga, An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations Progress in Mathematical Programming. pp. 1- 28 ,(1989) , 10.1007/978-1-4613-9617-8_1
Akiko Yoshise, Nimrod Megiddo, Masakazu Kojima, Toshihito Noma, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems ,(1991)
George J. Minty, Victor Klee, HOW GOOD IS THE SIMPLEX ALGORITHM Inequalities. pp. 159- 175 ,(1970)
Michael J. Todd, Donald Goldfarb, Robert G. Bland, The Ellipsoid Method: A Survey The Ellipsoid Method: A Survey. ,(1980)
Alexander Schrijver, Theory of Linear and Integer Programming ,(1986)
James Renegar, A polynomial-time algorithm, based on Newton's method, for linear programming Mathematical Programming. ,vol. 40, pp. 59- 93 ,(1988) , 10.1007/BF01580724