Long-step strategies in interior-point primal-dual methods
暂无分享,去创建一个
[1] C. C. Gonzaga,et al. An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations , 1989 .
[2] Richard A. Tapia,et al. On the Quadratic Convergence of the Simplified Mizuno-Todd-Ye Algorithm for Linear Programming , 1997, SIAM J. Optim..
[3] Shinji Mizuno,et al. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..
[4] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[5] Yinyu Ye,et al. An O(n3L) potential reduction algorithm for linear programming , 1991, Math. Program..
[6] Nimrod Megiddo,et al. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.
[7] Yurii Nesterov,et al. Complexity estimates of some cutting plane methods based on the analytic barrier , 1995, Math. Program..
[8] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[9] D. Bayer,et al. The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .
[10] D. Bayer,et al. The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories , 1989 .
[11] Kunio Tanabe,et al. Centered newton method for mathematical programming , 1988 .
[12] B. Jansen,et al. Interior-Point Methodology for Linear Programming: Duality, Sensitivity Analysis and Computational Aspects , 1993 .
[13] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[14] Pravin M. Vaidya,et al. An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations , 1990, Math. Program..
[15] Michael J. Todd,et al. A Centered Projective Algorithm for Linear Programming , 1990, Math. Oper. Res..