Boundary Behavior of Interior Point Algorithms in Linear Programming
暂无分享,去创建一个
[1] R. Gomory. TRAJECTORIES TENDING TO A CRITICAL POINT IN 3-SPACE* , 1955 .
[2] L. D. Pyle. A generalized inverse ∈-algorithm for constructing intersection projection matrices, with applications , 1967 .
[3] C. M. Place,et al. Ordinary Differential Equations , 1982, The Mathematical Gazette.
[4] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, STOC '84.
[5] Michael A. Saunders,et al. On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..
[6] Earl R. Barnes,et al. A variation on Karmarkar’s algorithm for solving linear programming problems , 1986, Math. Program..
[7] Lenore Blum,et al. Towards an Asymptotic Analysis of Karmarkar's Algorithm , 1986, Inf. Process. Lett..
[8] M. Shub. Global Stability of Dynamical Systems , 1986 .
[9] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[10] D. Bayer,et al. The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories , 1989 .
[11] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .
[12] D. Bayer,et al. The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .