A new second-order cone programming relaxation for max-cut problems

Journal of the Operations Research Society of Japan

Volumn 46, Issue 2, 2003, Pages 164-177

  Muramatsu, Masakazu ^a   Suzuki, Tsunehiro ^b  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b SOPHIA UNIVERSITY   (Japan)

Author keywords

Branch and bound method; Combinatorial optimization; MAX CUT; Relaxation; Second order cone programming

Indexed keywords

EID: 0242324790     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.46.164     Document Type: Article

References (30)

1. E. D. Andersen, C. Roos and T. Terlaky: On implementing a primal-dual interior-point method for conic quadratic optimization. Working Paper, Helsinki School of Economics and Business Administration, Helsinki, Finland (2000).
2. E. Balas, S. Ceria and G. Cornuéjols: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming, 58 (1993) 295-323.
3. F. Barahona, M. Jünger and G. Reinelt: Experiments in quadratic 0-1 programming. Mathematical Programming, 44 (1989) 127-137.
4. F. Barahona and L. Ladányi: Branch and cut based on the volume algorithm: Steiner trees in graphs and max-cut. IBM report RC22221 (2001).
5. S. J. Benson and Y. Ye: DSDP3: Dual scaling algorithm for general positive semidefinite programming. Working Paper, Dept. of Management Science, University of Iowa, Iowa City, Iowa, USA (2001).
6. S. Burer and R. Monteiro: A projected gradient algorithm for solving the maxcut SDP relaxation. Optimization Methods and Software, 15 (2001) 175-200.
7. L. Faybusovich: Euclidean Jordan algebras and interior-point algorithms. Journal of Positivity, 1 (1997) 331-357.
8. T. Fujie and M. Kojima: Semidefinite relaxation for nonconvex programs. Journal of Global Optimization, 10 (1997) 367-380.
9. K. Fujisawa, M. Kojima and K. Nakata: SDPA (Semidefinite Programming Algorithm) User's Manual. B-308, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan (1998).
10. M. X. Goemans and D.P. Williamson: Improved approximation algorithms for maximum cut and satisfiability programs using semidefinite programming. Journal of the ACM, 42 (1995) 1115-1145.
11. M. Grötschel, L. Lovász and A. Schrijver: Geometric Algorithms and Combinatorial Optimization (Springer, New York, 1988).
12. C. Helmberg and F. Rendl: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. Mathematical Programming, 82 (1998) 291-315.
13. C. Helmberg and F. Rendl: A spectral bundle method for semidefinite programming. SIAM Journal on Optimization, 10 (2001) 673-696.
14. C. Helmberg, F. Rendl, R. J. Vanderbei and H. Wolkowicz: An interior point method for semidefinite programming. SIAM Journal Optimization, 6 (1996) 342-361.
15. S. Homer and M. Peinado: Design and performance of parallel and distributed approximation algorithms for maxcut. manuscript, Dept. of Computer Science and Center for Computational Science, Boston University, Boston, MA, USA (1995).
16. S. Kim and M. Kojima: Second order cone programming relaxation of nonconvex quadratic optimization problems. Optimization Methods and Software, 15 (2001) 201-224.
17. M. Kojima, S. Shindoh and S. Hara: Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM Journal on Optimization, 7 (1997) 86-125.
18. R. D. C. Monteiro: Primal-dual path-following algorithms for semidefinite programming. SIAM Journal on Optimization, 7 (1995) 663-678.
19. R. D. C. Monteiro and T. Tsuchiya: Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions. Mathematical Programming, 88 (1999) 61-83.
20. M. Muramatsu: On a commutative class of search directions for linear programming over symmetric cones. Journal of Optimization Theory and Application, 112 (2002) 595-625.
21. Y. E. Nesterov: Semidefinite relaxation and nonconvex quadratic optimization. Optimization Methods and Software, 9 (1998) 141-160.
22. Y. E. Nesterov and M.J. Todd: Primal-dual interior-point methods for self-scaled cones. SIAM Journal on Optimization, 8 (1998) 324-364.
23. G. Pataki and S. Schmieta: The DIMACS library of semidefinite-quadratic-linear programs. Technical Report, Computational Optimization Research Center, Columbia University, NY, USA (1999).
24. S. Poljak, F. Rendl and H. Wolkowicz: A recipe for semidefinite relaxation for (0,1)-quadratic programming. Journal of Global Optimization, 7 (1995) 51-73.
25. H. D. Sherali and C.H. Tuncbilek: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. Journal of Global Optimization, 2 (1992) 101-112.
26. S. H. Schmieta and F. Alizadeh: Associative algebras, symmetric cones and polynomial time interior point algorithms. Mathematics of Operations Research, 26 (2001) 543-564.
27. J. F. Sturm: Using SEDUMI 1.0x, A MATLAB toolbox for optimization over symmetric cones. Technical report, Dept. of Quantitative Economics, Maastricht University, Maastricht, The Netherlands (1999).
28. T. Tsuchiya: A polynomial primal-dual path-following algorithm for second-order cone programming. Research Memorandum No. 649, The Institute of Statistical Mathematics, Tokyo, Japan (1997).
29. T. Tsuchiya: A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming. Optimization Methods and Software, 11 and 12 (1999) 141-182.
30. Y. Ye: Approximating quadratic programming with bound and quadratic constraints. Mathematical Programming, 84 (1999) 219-226.