An Efficient Algorithm for Solving the MAXCUT SDP Relaxation

In this paper we present a projected gradient algorithm for solving the semideenite programming (SDP) relaxation of the maximum cut (MAXCUT) problem. Coupled with a randomized method, this gives a very eecient approximation algorithm for the MAXCUT problem. We report computational results comparing our method with two earlier successful methods on problems with dimension up to 3000.

[1]  Masakazu Kojima,et al.  Semidefinite Programming Relaxation for Nonconvex Quadratic Programs , 1997, J. Glob. Optim..

[2]  Franz Rendl,et al.  Solving Graph Bisection Problems with Semidefinite Programming , 2000, INFORMS J. Comput..

[3]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[4]  R. Pinter.  Optimal layer assignment for interconnect , 1984 .

[5]  R. Vanderbei,et al.  An Interior-point Method for Semideenite Programming an Interior-point Method for Semideenite Programming , 1994 .

[6]  Satissed Now Consider.  Improved Approximation Algorithms for Maximum Cut and Satissability Problems Using Semideenite Programming , 1997 .

[7]  Y. Nesterov.  Semidefinite relaxation and nonconvex quadratic optimization , 1998 .

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

[9]  Xiong Zhang,et al.  Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization , 1999, SIAM J. Optim..

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

[11]  Yoji Kajitani,et al.  A graph- theoretic via minimization algorithm for two layer printed circuit boards , 1983 .

[12]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[13]  Masakazu Kojima,et al.  Numerical Evaluation of SDPA (Semidefinite Programming Algorithm) , 2000 .

[14]  Marcus Peinado,et al.  Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut , 1997, J. Parallel Distributed Comput..

[15]  Masakazu Kojima,et al.  Exploiting sparsity in primal-dual interior-point methods for semidefinite programming , 1997, Math. Program..