Initialization in semidefinite programming via a self-dual skew-symmetric embedding

The formulation of interior point algorithms for semidefinite programming has become an active research area, following the success of the methods for large-scale linear programming. Many interior point methods for linear programming have now been extended to the more general semidefinite case, but the initialization problem remained unsolved. In this paper we show that the initialization strategy of embedding the problem in a self-dual skew-symmetric problem can also be extended to the semidefinite case. This method also provides a solution for the initialization of quadratic programs and it is applicable to more general convex problems with conic formulation.

[1]  F. Potra,et al.  Homogeneous Interior{point Algorithms for Semideenite Programming , 1995 .

[2]  Yinyu Ye,et al.  On a homogeneous algorithm for the monotone complementarity problem , 1999, Math. Program..

[3]  Yinyu Ye,et al.  Convergence behavior of interior-point algorithms , 1993, Math. Program..

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

[5]  Katya Scheinberg,et al.  Interior Point Trajectories in Semidefinite Programming , 1998, SIAM J. Optim..

[6]  Shuzhong Zhang,et al.  Symmetric primal-dual path-following algorithms for semidefinite programming , 1999 .

[7]  B. Jansen,et al.  The theory of linear programming:skew symmetric self-dual problems and the central path * , 1994 .

[8]  G. Pataki.  On the Facial Structure of Cone-LP's and Semi-Definite Programs , 1994 .

[9]  F. Potra,et al.  On homogeneous interrior-point algorithms for semidefinite programming , 1998 .

[10]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[11]  Shinji Mizuno,et al.  An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm , 1994, Math. Oper. Res..

[12]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[13]  Michael J. Todd,et al.  Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming , 1998, Math. Program..

[14]  Gábor Pataki,et al.  On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues , 1998, Math. Oper. Res..

[15]  Yinyu Ye,et al.  On homogeneous and self-dual algorithms for LCP , 1997, Math. Program..

[16]  Motakuri V. Ramana,et al.  An exact duality theory for semidefinite programming and its complexity implications , 1997, Math. Program..