Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results

Primal-dual interior-point path-following methods for semidefinite programming are considered. Several variants are discussed, based on Newton's method applied to three equations: primal feasibility, dual feasibility, and some form of centering condition. The focus is on three such algorithms, called the XZ, XZ+ZX, and Q methods. For the XZ+ZX and Q algorithms, the Newton system is well defined and its Jacobian is nonsingular at the solution, under nondegeneracy assumptions. The associated Schur complement matrix has an unbounded condition number on the central path under the nondegeneracy assumptions and an additional rank assumption. Practical aspects are discussed, including Mehrotra predictor-corrector variants and issues of numerical stability. Compared to the other methods considered, the XZ+ZX method is more robust with respect to its ability to step close to the boundary, converges more rapidly, and achieves higher accuracy.

[1]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[2]  Tosio Kato.  A Short Introduction to Perturbation Theory for Linear Operators , 1982 .

[3]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[4]  Yin Zhang,et al.  On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms , 1992, SIAM J. Optim..

[5]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[6]  M. Overton,et al.  A New Primal-Dual Interior-Point Method for Semidefinite Programming , 1994 .

[7]  Stephen P. Boyd,et al.  A primal—dual potential reduction method for problems involving matrix inequalities , 1995, Math. Program..

[8]  Shinji Hara,et al.  Interior Point Methods for the Monotone Linear Complementarity Problem in Symmetric Matrices , 1995 .

[9]  Michael L. Overton,et al.  Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices , 1995, SIAM J. Matrix Anal. Appl..

[10]  Robert J. Vanderbei,et al.  An Interior-Point Method for Semidefinite Programming , 1996, SIAM J. Optim..

[11]  M. Shida,et al.  Existence of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP , 1996 .

[12]  Michael J. Todd,et al.  Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..

[13]  Renato D. C. Monteiro,et al.  A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming , 1997, Math. Program..

[14]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[15]  Michael L. Overton,et al.  Complementarity and nondegeneracy in semidefinite programming , 1997, Math. Program..

[16]  MASAYUKI SHIDA,et al.  Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP , 1998, SIAM J. Optim..

[17]  Michael J. Todd,et al.  Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..

[18]  Renato D. C. Monteiro,et al.  Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions , 1998, SIAM J. Optim..

[19]  Yin Zhang,et al.  On Extending Some Primal-Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming , 1998, SIAM J. Optim..

[20]  Kim-Chuan Toh,et al.  On the Nesterov-Todd Direction in Semidefinite Programming , 1998, SIAM J. Optim..

[21]  Masakazu Kojima,et al.  A Predictor-corrector Interior-point Algorithm for the Semidenite Linear Complementarity Problem Using the Alizadeh-haeberly-overton Search Direction , 1996 .