A Projected Gradient Algorithm for Solving the Maxcut Sdp Relaxation

@inproceedings{Burer2001APG,
  title={A Projected Gradient Algorithm for Solving the Maxcut Sdp Relaxation},
  author={Samuel Burer and Renato D. C. Monteiro},
  year={2001}
}
In this paper, we present a projected gradient algorithm for solving the semide nite programming (SDP) relaxation of the maximum cut (maxcut) problem. Coupled with a randomized method, this gives a very eÆcient approximation algorithm for the maxcut problem. We report computational results comparing our method with two earlier successful methods on problems with dimension up to 7000. 

Citations

Publications citing this paper.
Showing 1-10 of 40 extracted citations

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…