On the convergence of the method of analytic centers when applied to convex quadratic programs
暂无分享,去创建一个
[1] Anthony V. Fiacco,et al. The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual Method , 1964 .
[2] Anthony V. Fiacco,et al. Computational Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear Programming , 1964 .
[3] Bùi-Trong-Liêu,et al. La mèthode des centres dans un espace topologique , 1966 .
[4] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[5] Pravin M. Vaidya,et al. Fast algorithms for convex quadratic programming and multicommodity flows , 1986, STOC '86.
[6] G. Sonnevend. An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .
[7] J. Goffin. Affine methods in nondifferentiable optimization , 1987 .
[8] J. Stoer,et al. An implementation of the method of analytic centers , 1988 .
[9] Uwe Zimmermann,et al. On Recent Developments in Linear Programming , 1988 .
[10] M. Kojima,et al. A primal-dual interior point algorithm for linear programming , 1988 .
[11] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[12] R. Freund. Projective transformations for interior point methods, Part I: Basic Theory and Linear Programming , 1988 .
[13] R. Freund. Projective Transformations for Interior Point Methods, Part II: Analysis of An Algorithm for Finding the Weighted Center of a Polyhedral System , 1988 .
[14] F. Jarre. On the method of analytic centers for solving smooth convex programs , 1988 .
[15] Shinji Mizuno,et al. A new continuation method for complementarity problems with uniformP-functions , 1989, Math. Program..
[16] C. C. Gonzaga,et al. An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations , 1989 .
[17] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .
[18] Sanjay Mehrotra,et al. An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations , 1990, Math. Oper. Res..
[19] J. Stoer,et al. Global ellipsoidal approximations and homotopy methods for solving convex analytic programs , 1990 .
[20] Michael J. Todd,et al. Containing and shrinking ellipsoids in the path-following algorithm , 1990, Math. Program..
[21] Donald Goldfarb,et al. An O(n3L) primal interior point algorithm for convex quadratic programming , 1991, Math. Program..
[22] Jean-Philippe Vial,et al. A polynomial method of approximate centers for linear programming , 1992, Math. Program..