A projected gradient algorithm for solving the maxcut SDP relaxation

Optimization Methods and Software

Volumn 15, Issue 3-4, 2001, Pages 175-200

  Burer, Samuel ^a   Monteiro, Renato D C ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Approximation algorithm; Maxcut; Projected gradient method; Semidefinite programming; Semidefinite relaxation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; OPTIMIZATION;

SEMIDEFINITE PROGRAMMING (SDP);

QUADRATIC PROGRAMMING;

EID: 0036457237     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (26)

1. Alizadeb, F. (1995). Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5(1), 13-51.
2. Barahona, F., Grötschel, M., Jünger, M. and Reinelt, G. (1988). An application of combinatorial optimization to statistical optimization and circuit layout design. Operations Research, 36(3), 493-513.
3. Benson, S., Ye, Y. and Zhang, X. Solving large-scale sparse semidefinite programs for combinatorial optimization. Research Report, Department of Management Science, University of Iowa, Iowa, 1998. To appear in SIAM Journal on Optimization.
4. Chang, K. C. and Du, D. H. (1987). Efficient algorithms for layer assignment problems. IEEE Transactions on Computer-Aided Design, CAD-6(1), 67-78.
5. Chen, R., Kajitani, Y. and Chan, S. (1983). A graph-theoretic via minimization algorithm for two-layer printed circuit boards. IEEE Transactions on Circuits and Systems, CAS-30(5), 284-299.
6. Fujie, T. and Kojima, M. (1997). Semidefinite programming relaxation for nonconvex quadratic programs. J. Global Optim., 10, 168-189.
7. Fujisawa, K., Fukuda, M., Kojima, M. and Nakata, K. (1999). Numerical evaluation of SDPA (Semidefinite Programming Algorithm). In: Frenk, H., Roos, K., Terlaky, T. and Zhang, S. Editors, High Performance Optimization, pp. 267-301. Kluwer Academic Press.
8. Fujisawa, K., Kojima, M. and Nakata, K. (1997). Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. Mathematical Programming, 79, 235-253.
9. Goemans, M. X. and Williamson, D. P. (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of ACM, 1115-1145, 42.
10. Golub, G. H. and Van Loan, C. E. Matrix Computations: Second edition. The John Hopkins University Press, Baltimore, MA 21211, 1989.
11. Helmberg, C. and Rendl, F. (2000). A spectral bundle method for semidefinite programming. SIAM Journal on Optimization, 10, 673-696.
12. Helmberg, C., Rendl, F., Vanderbei, R. J. and Wolkowicz, H. (1996). An interior-point method for semidefinite programming. SIAM Journal on Optimization, 6, 342-361.
13. Karisch, S. E., Rendl, F. and Clausen, J., Solving graph bisection problems with semidefinite programming. Technical Report DIKU-TR-97/9, Department of Computer Sciences, University of Copenhagen, July 1997.
14. To appear in INFORMS Journal on Computing.
15. Chih-Jen Lin and Romesh Saigal (2000). An incomplete cholesky factorization for dense matrices. BIT, 40, 536-558.
16. Lovász, L., On the Shannon Capacity of a graph. IEEE Transactions of Information Theory, IT-25(1), 1-7, January 1979.
17. Lovász, L. and Schrijver, A. (1991). Cones of matrices and setfunctions, and 0-1 optimization. SIAM Journal on Optimization, 1, 166-190.
18. Nesterov, Y. (1998). Semidenite relaxation and nonconvex quadratic optimization. Optimization Methods and Software, 9, 141-160.
19. Peinado, M. and Homer, S. (1997). Design and performance of parallel and distributed approximation algorithms for maxcut. Journal of Parallel and Distributed Computing, 46, 48-61.
20. Pinter, R. Y. (1984). Optimal layer assignment for interconnect. J. VLSI Comput. Syst., 1, 123-137.
21. Poljak, S., Rendl, F. and Wolkowicz, H. (1995). A recipe for semidefinite relaxation for 0-1 quadratic programming. Journal of Global Optimization, 7, 51-73.
22. Poljak, S. and Tuza, Z., Maximum cuts and large bipartite subgraphs. In: Combinatorial Optimization (New Brunswick, NJ, 1992-1993), pp. 181-244.
23. Amer. Math. Soc., Providence, RI, 1995.
24. Shor, N. Z. (1987). Quadratic optimization problems. Soviet Journal of Computer and Systems Science, 25, 1-11.
25. Originally published in Tekhnicheskaya Kibernetika, No. 1, 1987, pp. 128-139.
26. Ye, Y. (1999). Approximating quadratic programming with quadratic constraints. Mathematical Programming, 84, 219-226.