Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
暂无分享,去创建一个
[1] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[2] M. Kojima,et al. A primal-dual interior point algorithm for linear programming , 1988 .
[3] R. C. Monteiro,et al. Interior path following primal-dual algorithms , 1988 .
[4] Shinji Mizuno,et al. A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..
[5] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..
[6] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..
[7] Yinyu Ye,et al. A Class of Projective Transformations for Linear Programming , 1990, SIAM J. Comput..
[8] F. Jarre. An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices , 1993 .
[9] Shinji Mizuno,et al. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..
[10] R. Vanderbei,et al. An Interior-point Method for Semideenite Programming an Interior-point Method for Semideenite Programming , 1994 .
[11] Stephen P. Boyd,et al. A primal—dual potential reduction method for problems involving matrix inequalities , 1995, Math. Program..
[12] Shuzhong Zhang,et al. Symmetric primal-dual path-following algorithms for semidefinite programming , 1999 .
[13] Farid Alizadeh,et al. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..
[14] Robert J. Vanderbei,et al. An Interior-Point Method for Semidefinite Programming , 1996, SIAM J. Optim..
[15] P. Tseng. Search Directions And Convergence Analysis Of Some Infeasible Path-Following Methods For The Monoton , 1996 .
[16] Michael J. Todd,et al. Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..
[17] Renato D. C. Monteiro,et al. A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming , 1997, Math. Program..
[18] Renato D. C. Monteiro,et al. Primal-Dual Path-Following Algorithms for Semidefinite Programming , 1997, SIAM J. Optim..
[19] Shinji Hara,et al. Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices , 1997, SIAM J. Optim..
[20] Michael L. Overton,et al. Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results , 1998, SIAM J. Optim..
[21] Michael J. Todd,et al. Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..
[22] Masakazu Kojima,et al. Local convergence of predictor—corrector infeasible-interior-point algorithms for SDPs and SDLCPs , 1998, Math. Program..
[23] Yin Zhang,et al. On Extending Some Primal-Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming , 1998, SIAM J. Optim..
[24] Zhi-Quan Luo,et al. Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming , 1998, SIAM J. Optim..
[25] Florian A. Potra,et al. A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming , 1998, SIAM J. Optim..
[26] P. Tseng. Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp ∗ , 1998 .
[27] Kim-Chuan Toh,et al. On the Nesterov-Todd Direction in Semidefinite Programming , 1998, SIAM J. Optim..
[28] Masakazu Kojima,et al. A Predictor-corrector Interior-point Algorithm for the Semidenite Linear Complementarity Problem Using the Alizadeh-haeberly-overton Search Direction , 1996 .
[29] M. Kojima,et al. A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming , 1999 .