Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming

This paper establishes the superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming (SDP) under the assumptions that the semidefinite program has a strictly complementary primal-dual optimal solution and that the size of the central path neighborhood tends to zero. The interior point algorithm considered here closely resembles the Mizuno--Todd--Ye predictor-corrector method for linear programming which is known to be quadratically convergent. It is shown that when the iterates are well centered, the duality gap is reduced superlinearly after each predictor step. Indeed, if each predictor step is succeeded by r consecutive corrector steps then the predictor reduces the duality gap superlinearly with order 2 ( 1 + 2 - r ). The proof relies on a careful analysis of the central path for SDP. It is shown that under the strict complementarity assumption, the primal-dual central path converges to the analytic center of the primal-dual optimal solution set, and the distance from any point on the central path to this analytic center is bounded by the duality gap.

[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..