Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
暂无分享,去创建一个
[1] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[2] J. Stoer,et al. An implementation of the method of analytic centers , 1988 .
[3] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[4] M. Todd,et al. Recent Developments and New Directions in Linear Programming , 1988 .
[5] F. Jarre. On the method of analytic centers for solving smooth convex programs , 1988 .
[6] D. Bayer,et al. The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories , 1989 .
[7] Jeffrey C. Lagarias,et al. Power series variants of Karmarkar-type algorithms , 1989, AT&T Technical Journal.
[8] Mauricio G. C. Resende,et al. An implementation of Karmarkar's algorithm for linear programming , 1989, Math. Program..
[9] D. Bayer,et al. The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .
[10] J. Stoer,et al. Global ellipsoidal approximations and homotopy methods for solving convex analytic programs , 1990 .
[11] Josef Stoer,et al. On the complexity of following the central path of linear programs by linear extrapolation II , 1991, Math. Program..
[12] Shinji Mizuno,et al. An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems , 1991, Math. Program..
[13] Jean-Philippe Vial,et al. A polynomial method of approximate centers for linear programming , 1992, Math. Program..