Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
暂无分享,去创建一个
[1] R. Vanderbei,et al. An Interior-point Method for Semideenite Programming an Interior-point Method for Semideenite Programming , 1994 .
[2] Masakazu Kojima,et al. Local convergence of predictor—corrector infeasible-interior-point algorithms for SDPs and SDLCPs , 1998, Math. Program..
[3] Renato D. C. Monteiro,et al. Primal-Dual Path-Following Algorithms for Semidefinite Programming , 1997, SIAM J. Optim..
[4] Osman Güler,et al. Limiting behavior of weighted central paths in linear programming , 1994, Math. Program..
[5] Stephen P. Boyd,et al. Semidefinite Programming , 1996, SIAM Rev..
[6] Stephen P. Boyd,et al. A primal—dual potential reduction method for problems involving matrix inequalities , 1995, Math. Program..
[7] Shinji Hara,et al. Interior Point Methods for the Monotone Linear Complementarity Problem in Symmetric Matrices , 1995 .
[8] Nimrod Megiddo,et al. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.
[9] Michael J. Todd,et al. Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..
[10] Chih-Jen Lin,et al. An infeasable start predictor corrector method for semi-definite linear programming , 1995 .
[11] Yinyu Ye,et al. On quadratic and $$O\left( {\sqrt {nL} } \right)$$ convergence of a predictor—corrector algorithm for LCP , 1993, Math. Program..
[12] Robert J. Vanderbei,et al. An Interior-Point Method for Semidefinite Programming , 1996, SIAM J. Optim..
[13] R. Monteiro,et al. Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem , 1996 .
[14] Shuzhong Zhang,et al. Symmetric primal-dual path-following algorithms for semidefinite programming , 1999 .
[15] Michael L. Overton,et al. Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results , 1998, SIAM J. Optim..
[16] Yin Zhang,et al. On Extending Some Primal-Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming , 1998, SIAM J. Optim..
[17] A. Hoffman. On approximate solutions of systems of linear inequalities , 1952 .
[18] M. Pinar,et al. Piecewise-Linear Pathways to the Optimal Solution Set in Linear Programming , 1997 .
[19] Florian A. Potra,et al. A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming , 1998, SIAM J. Optim..
[20] Shinji Mizuno,et al. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..
[21] Michael J. Todd,et al. Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..