Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem

Discrete Applied Mathematics

Volumn 119, Issue 1-2, 2002, Pages 79-106

  Anjos, Miguel F ^a   Wolkowicz, Henry ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Cut polytope; Lagrangian relaxation; Max Cut problem; Metric polytope; Semidefinite programming relaxations

Indexed keywords

EID: 84867947404     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00266-9     Document Type: Article

References (56)

1. F. Alizadeh, J.-P. Haeberly, M.V. Nayakkankuppam, M.L. Overton, S. Schmieta, SDP pack user's guide - version 0.9 Beta, Technical Report TR1997-737, Courant Institute of Mathematical Sciences, NYU, New York, NY, June 1997.
2. M.F. Anjos, H. Wolkowicz, A strengthened SDP relaxation via a second lifting for the Max-Cut problem, Technical Research Report, CORR 99-55, University of Waterloo, Waterloo, Ont., 1999, 28p.
3. M.F. Anjos, H. Wolkowicz, A tight semidefinite relaxation of the cut polytope, Technical Research Report, CORR 2000-19, University of Waterloo, Waterloo, Ont., 2000, 24p.
4. K.M. Anstreicher, X. Chen, H. Wolkowicz, and Y. Yuan Strong duality for a trust-region type relaxation of the quadratic assignment problems Linear Algebra Appl. 301 1-3 1999 121 136 (Pubitemid 129563144)
5. K.M. Anstreicher, and H. Wolkowicz On Lagrangian relaxation of quadratic matrix constraints SIAM J. Matrix Anal. Appl. 22 1 2000 41 55 (Pubitemid 33229417)
6. E. Balas, A modified lift-and-project procedure, Math. Programming Ser. B 79(1-3) 19-31, 1997, Lectures on Mathematical Programming, ismp97, Lausanne, 1997. (Pubitemid 127397719)
7. E. Balas, S. Ceria, and G. Cornuejols A lift-and-project cutting plane algorithm for mixed 0-1 programs Math. Programming 58 1993 295 324
8. E. Balas, S. Ceria, G. Cornuéjols, Solving mixed 0-1 programs by a lift-and-project method, in: Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, 1993, ACM, New York, 1993, pp. 232-242. (Pubitemid 23612723)
9. 5 Oper. Res. Lett. 2 3 1983 107 111 (Pubitemid 14466895)
10. F. Barahona On cuts and matchings in planar graphs Math. Programming Ser. A 60 1 1993 53 68 (Pubitemid 23715731)
11. F. Barahona, M. Grötschel, M. Jünger, and G. Reinelt An application of combinatorial optimization to statistical physics and circuit layout design Oper. Res. 36 1988 493 513 (Pubitemid 18655113)
12. S.J. Benson, Y. Ye, X. Zhang, Solving large-scale sparse semidefinite programs for combinatorial optimization, SIAM J. Optim. 10(2) (2000) 443-461 (electronic).
13. B. Borchers CSDP, a C library for semidefinite programming Optim. Methods Software (Interior point methods) 11/12 1-4 1999 613 623
14. B. Borchers SDPLIB 1.2, a library of semidefinite programming test problems Optim. Methods Software (Interior point methods) 11 1 1999 683 690
15. S. Burer, R.D.C. Monteiro, An efficient algorithm for solving the MAXCUT SDP relaxation, Technical Report, Georgia Tech., Atlanta, GA, 1999.
16. C. Delorme, and S. Poljak Laplacian eigenvalues and the maximum cut problem Math. Programming 62 3 1993 557 574
17. M.M. Deza, and M. Laurent Geometry of Cuts and Metrics 1997 Springer Berlin
18. U. Feige, G. Schechtman, On the optimality of the random hyperplane rounding technique for MAX CUT, Technical Report, Weizmann Institute, Rehovot, Israel, 2000.
19. M.R. Garey, and D.S. Johnson Computers and Intractabilty: A Guide to the Theory of NP-Completeness 1979 Freeman San Francisco
20. M.X. Goemans Semidefinite programming in combinatorial optimization Math. Programming 79 1997 143 162
21. M.X. Goemans, Semidefinite programming and combinatorial optimization, Documenta Math. ICM 1998 (1998) 657-666 (Invited talk at the International Congress of Mathematicians, Berlin, 1998).
22. M.X. Goemans, and F. Rendl Combinatorial optimization H. Wolkowicz, R. Saigal, L. Vandenberghe, Handbook of Semidefinite Programming: Theory, Algorithms, and Applications 2000 Kluwer Academic Publishers Boston, MA
23. M.X. Goemans, D.P. Williamson,.878-approximation algorithms for MAX CUT and MAX 2SAT, in: ACM Symposium on Theory of Computing (STOC), Montréal, Québec, 1994.
24. M.X. Goemans, and D.P. Williamson Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming J. Assoc. Comput. Mach. 42 6 1995 1115 1145
25. B. Grone, C.R. Johnson, E. Marques de Sa, and H. Wolkowicz Positive definite completions of partial Hermitian matrices Linear Algebra Appl. 58 1984 109 124
26. J. Hastad, Some optimal inapproximability results, in: Proceedings of the 29th ACM Symposium on Theory and Computation, 1997.
27. C. Helmberg, An interior-point method for semidefinite programming and max-cut bounds, PhD Thesis, Graz University of Technology, Austria, 1994.
28. C. Helmberg, SBmethod - A C++ implementation of the spectral bundle method, ZIB preprint 00-35, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustraße 7, 14196, Berlin, Germany, October 2000.
29. C. Helmberg, K.C. Kiwiel, A spectral bundle method with bounds, ZIP preprint sc-99-37, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustraße 7, 14195, Berlin, Germany, November 1999.
30. C. Helmberg, and F. Oustry Bundle methods to minimize the maximum eigenvalue function H. Wolkowicz, R. Saigal, L. Vandenberghe, Handbook of Semidefinite Programming: Theory, Algorithms, and Applications 2000 Kluwer Academic Publishers Boston, MA
31. C. Helmberg, S. Poljak, F, Rendl, H. Wolkowicz, Combining semidefinite and polyhedral relaxations for integer programs, in: Integer Programming and Combinatorial Optimization (Copenhagen, 1995), Springer, Berlin, 1995, pp. 124-134.
32. C. Helmberg, and F. Rendl A spectral bundle method for semidefinite programming SIAM J. Optim. 10 3 2000 673 696
33. C. Helmberg, F. Rendl, R.J. Vanderbei, and H. Wolkowicz An interior-point method for semidefinite programming SIAM J. Optim. 6 2 1996 342 361
34. R.A. Horn, C.R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge, 1994 (corrected reprint of the 1991 original).
35. C.R. Johnson Matrix completion problems: a survey Proc. Symp. Appl. Math. 40 1990 171 198
36. C.R. Johnson, B. Kroschel, and H. Wolkowciz An interior-point method for approximate positive semidefinite completions Comput. Optim. Appl. 9 2 1998 175 190
37. R.M. Karp Reducibility among combinatorial problems R.E. Miller, J.W. Thatcher, Complexity of Computer Computation 1972 Plenum Press New York 85 103
38. J.B. Lasserre, Optimality conditions and LMI relaxations for 0-1 programs, LAAS Research Report, LAAS-CNRS, Toulouse, France, 2000.
39. M. Laurent, A tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems, in: Topics in Semidefinite and Interior-Point Methods, The Fields Institute for Research in Mathematical Sciences, Communications Series, Vol. 18, American Mathematical Society, Providence, RI, 1998, pp. 51-76.
40. M. Laurent, and S. Poljak On a positive semidefinite relaxation of the cut polytope Linear Algebra Appl. 223/224 1995 439 461
41. M. Laurent, and S. Poljak On the facial structure of the correlation matrices SIAM J. Matrix Anal. Appl. 17 3 1996 530 547
42. M. Laurent, S. Poljak, and F. Rendl Connections between semidefinite relaxations of the max-cut and stable set problems Math. Programming 77 1997 225 246 (Pubitemid 127412631)
43. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, Wiley, Chichester, 1990 (with a foreword by Bryan Preas).
44. L. Lovász, and A. Schrijver Cones of matrices and set-functions and 0-1 optimization SIAM J. Optim. 1 2 1991 166 190
45. B. Mohar, S. Poljak, Eigenvalues in combinatorial optimization, in: Combinatorial Graph-Theoretical Problems in Linear algebra, IMA, Vol. 50, Springer, Berlin, 1993.
46. Y.E. Nesterov, Quality of semidefinite relaxation for nonconvex quadratic optimization, Technical Report, CORE, Universite Catholique de Louvain, Belgium, 1997.
47. Y.E. Nesterov, H. Wolkowicz, and Y. Ye Semidefinite programming relaxations of nonconvex quadratic optimization H. Wolkowicz, R. Saigal, L. Vandenberghe, Handbook of Semidefinite Programming: Theory, Algorithms and Applications 2000 Kluwer Academic Publishers Boston, MA 34
48. S. Poljak, F Rendl, and H. Wolkowicz A recipe for semidefinite relaxation for (0,1)-quadratic programming J. Global Optim. 7 1 1995 51 73
49. F. Rendl Semidefinite programming and combinatorial optimization Appl. Numer. Math. 29 1999 255 281 (Pubitemid 129503411)
50. H.D. Sherali, and W.P. Adams A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems SIAM J. Discrete Math. 3 3 1990 411 430
51. H.D. Sherali, and W.P. Adams A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems Discrete Appl. Math. 52 1 1994 83 106
52. N.Z. Shor Quadratic optimization problems Izv. Akad. Nauk SSSR Tekhn. Kibernet. 222 1 1987 128 139222
53. R. Stern, and H. Wolkowicz Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations SIAM J. Optim. 5 2 1995 286 313
54. V.A. Yakubovich The S-procedure and duality theorems for non-convex problems of quadratic programming Vestnik Leningrad Univ. 1973 1 1973 81 87
55. V.A. Yakubovich Nonconvex optimization problem: the infinite-horizon linear-quadratic control problem with quadratic constraints Systems Control Lett. 19 1 1992 13 22 (Pubitemid 23578598)
56. Y. Ye Approximating quadratic programming with bound and quadratic constraints Math. Programming 84 1999 219 226