A Subspace Semidefinite Programming for Spectral Graph Partitioning

A semidefinite program (SDP) is an optimization problem over n × n symmetric matrices where a linear function of the entries is to be minimized subject to linear equality constraints, and the condition that the unknown matrix is positive semidefinite. Standard techniques for solving SDP's require O(n3) operations per iteration. We introduce subspace algorithms that greatly reduce the cost os solving large-scale SDP's. We apply these algorithms to SDP approximations of graph partitioning problems. We numerically compare our new algorithm with a standard semidefinite programming algorithm and show that our subspace algorithm performs better.

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

[2]  E. Davidson.  The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices , 1975 .

[3]  D. Sorensen.  Numerical methods for large eigenvalue problems , 2002, Acta Numerica.

[4]  Bernard Philippe,et al.  The Davidson Method , 1994, SIAM J. Sci. Comput..

[5]  C. Lanczos.  Solution of Systems of Linear Equations by Minimized Iterations1 , 1952 .

[6]  Michael Holzrichter,et al.  A Graph Based Davidson Algorithm for the Graph Partitioning Problem , 1999, Int. J. Found. Comput. Sci..

[7]  Kim-Chuan Toh,et al.  SDPT3 -- A Matlab Software Package for Semidefinite Programming , 1996 .

[8]  R. Vanderbei,et al.  Max-min eigenvalue problems, primal-dual Interior point algorithms, and Trust region subproblemst , 1995 .

[9]  W. Arnoldi.  The principle of minimized iterations in the solution of the matrix eigenvalue problem , 1951 .

[10]  Michael Holzrichter,et al.  A Graph Based Method for Generating the Fiedler Vector of Irregular Problems , 1999, IPPS/SPDP Workshops.

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

[12]  Gerard L. G. Sleijpen,et al.  A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems , 1996, SIAM J. Matrix Anal. Appl..

[13]  S. Oliveira,et al.  On the Convergence Rate of a Preconditioned Subspace Eigensolver , 1999, Computing.

[14]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[15]  Brian Borchers.  CSDP 2.3 user's guide , 1999 .

[16]  H. Wolkowicz,et al.  Some applications of optimization in matrix theory , 1981 .

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

[18]  Suely Oliveira,et al.  A Multilevel Algorithm for Spectral Partitioning with Extended Eigen-Models , 2000, IPDPS Workshops.

[19]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[20]  Franz Rendl,et al.  A recipe for semidefinite relaxation for (0,1)-quadratic programming , 1995, J. Glob. Optim..

[21]  M. Overton,et al.  SDPPACK User''s Guide -- Version 0.9 Beta for Matlab 5.0. , 1997 .