An E cient Algorithm for Solving the MAXCUT SDP Relaxation

@inproceedings{Samuel1998AnEC,
  title={An E cient Algorithm for Solving the MAXCUT SDP Relaxation},
  author={L Samuel and Burery and C. RenatoD. and MonteirozDecember},
  year={1998}
}
  • L Samuel, Burery, +1 author MonteirozDecember
  • Published 1998
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. 

References

Publications referenced by this paper.
Showing 1-10 of 22 references

A spectral bundle method for semide nite programming. Manuscript, Konrad-Zuse-Zentrum fuer Informationstechnik Berlin, Takustrasse 7, D-14195

  • C. Helmberg, F. Rendl
  • 1997
Highly Influential
9 Excerpts

Solving large-scale sparse semide nite programs for com- binatorial optimization

  • S. Benson, Y. Ye, X. Zhang
  • Research Report, Department of Management Science…
  • 1998
Highly Influential
4 Excerpts

Semidenite relaxation and nonconvex quadratic optimization

  • Y. Nesterov
  • Optimization Methods and Software,
  • 1998

Similar Papers

Loading similar papers…