Solving large-scale sparse semidefinite programs for combinatorial optimization

SIAM Journal on Optimization

Volumn 10, Issue 2, 1999, Pages 443-461

  Benson, Steven J ^a   Ye, Yinyu ^a   Zhang, Xiong ^b  

^a UNIVERSITY OF IOWA   (United States)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Dual potential reduction algorithm; Maximum cut problem; Semidefinite programming

Indexed keywords

EID: 0039772219     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/s1052623497328008     Document Type: Article

References (37)

1. I. ADLER, N. K. KARMARKAR, M. G. C. RESENDE, AND G. VEIGA, An implementation of Karmarkar's algorithm for linear programming, Math. Programming, 44 (1989), pp. 297-335; errata, Math. Programming, 50 (1991), p. 415.
2. F. ALIZADEH, Combinatorial Optimization with Interior Point Methods and Semi-Definite Matrices, Ph.D. thesis, University of Minnesota, Minneapolis, 1991.
3. F. ALIZADEH, J. P. A. HAEBERLY, AND M. L. OVERTON, Primal-Dual Interior Point Methods for Semidefinite Programming, Technical Report 659, Computer Science Dept., Courant Institute of Mathematical Sciences, New York University, 1994.
4. K. M. ANSTREICHER AND M. FAMPA, A Long-Step Path Following Algorithm for Semidefinite Programming Problems, Working Paper, Dept. of Management Science, The University of Iowa, Iowa City, 1996.
5. K. E. ATKINSON, An Introduction to Numerical Analysis, 2nd ed., John Wiley, New York, 1989.
6. I. S. DUFF, Sparse numerical linear algebra: Direct methods and preconditioning, in The State of the Art in Numerical Analysis, Clarendon Press, Oxford, UK, 1997 pp. 27-62.
7. J. FALKNER, F. RENDL, AND H. WOLKOWICZ, A computational study of graph partitioning, Math. Programming, 66 (1994), pp. 211-240.
8. K. FUJISAWA, M. KOJIMA, AND K. NAKATA, Exploiting Sparsity in Primal-Dual Interior Point Methods for Semidefinite Programming, Research Report B-324, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, 1997.
9. T. FUJIE AND M. KOJIMA, Semidefinite programming relaxation for nonconvex quadratic programs, J. Global Optim., 10 (1997), pp. 367-380.
10. K. FUJISAWA, M. FUKUDA, M. KOJIMA, AND K. NAKATA, Numerical Evaluation of SDPA (SemiDefinite Programming Algorithm), Research Report B-330, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, 1997.
11. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for Maximum Cut and Satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach., 42 (1995), pp. 1115-1145.
12. C. HELMBERG AND F. RENDL, A Spectral Bundle Method for Semidefinite Programming, ZIB Preprint SC 97-37, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustrasse 7, D-14195 Berlin, Germany, 1997.
13. C. HELMBERG, F. RENDL, R. J. VANDERBEI, AND H. WOLKOWICZ, An interior point method for semidefinite programming, SIAM J. Optim., 6 (1996), pp. 342-361.
14. S. E. KARISCH, F. RENDL, AND J. CLAUSEN, Solving Graph Bisection Problems with Semidefinite Programming, Technical Report DIKU-TR-97/9, Dept. of Computer Science, University of Copenhagen, 1997.
15. N. KARMARKAR, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984), pp. 373-395.
16. M. KOJIMA, S. SHINDOH, AND S. HARA, Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices, SIAM J. Optim., 7 (1997), pp. 86-125.
17. C. LIN AND R. SAIGAL, On Solving Large Scale Semidefinite Programming Problems - A Case Study of Quadratic Assignment Problem, Technical Report, Dept. of Industrial and Operations Engineering, University of Michigan, Ann Arbor, 1997.
18. L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, IT-25 (1979), pp. 1-7.
19. L. LOVÁSZ AND A. SHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
20. R. D. C. MONTEIRO AND P. R. ZANJÁCOMO, Implementation of Primal-Dual Methods for Semidefinite Programming Based on Monteiro and Tsuchiya Directions and Their Variants, Technical Report, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, 1997.
21. R. D. C. MONTEIRO AND Y. ZHANG, A Unified Analysis for a Class of Path-Following Primal-Dual Interior-Point Algorithms for Semidefinite Programming, Math. Programming, 81 (1998), pp. 281-299.
22. M. MURAMATSU, Affine Scaling Algorithm Fails for Semidefinite Programming, Technical Report, Department of Mechanical Engineering, Sophia University, Tokyo, 1996.
23. M. MURAMATSU AND R. VANDERBEI, Primal-Dual Affine Scaling Algorithms Fail for Semidefinite Programming, Technical Report, SOR, Princeton University, Princeton, NJ, 1997.
24. YU. E. NESTEROV, Quality of Semidefinite Relaxation for Nonconvex Quadratic Optimization, CORE Discussion Paper 9719, Louvain, Belgium, 1997.
25. YU. E. NESTEROV AND A. NEMIROVSKII, Interior-Point Polynomial Methods in Convex Programming, SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, PA, 1994.
26. Y. E. NESTEROV AND M. TODD, Primal-Dual Interior Point Methods for Self-Scaled Cones, SIAM J. Optim., 8 (1998), p. 324-364.
27. S. POLIJAK, F. RENDL, AND H. WOLKOWICZ, A recipe for semidefinite relaxation for 0-1 quadratic programming, J. Global Optim., 7 (1995), pp. 51-73.
28. H. D. SHERALI AND W. P. ADAMS, Computational advances using the reformulation-linearization technique (rlt) to solve discrete and continuous nonconvex problems, Optima, 49 (1996), pp. 1-6.
29. N. Z. SHOR, Quadratic optimization problems, Soviet J. Comput. Systems Sci., 25 (1987), pp. 1-11; originally published in Tekhnicheskaya Kibernetika, 1 (1987), pp. 128-139.
30. N. Z. SHOR, Quadratic optimization problems, Soviet J. Comput. Systems Sci., 25 (1987), pp. 1-11; originally published in Tekhnicheskaya Kibernetika, 1 (1987), pp. 128-139.
31. M. J. TODD, On Search Directions in Interior-Point Methods for Semidefinite Programming, Technical Report 1205, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1997.
32. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
33. H. WOLKOWICZ AND Q. ZHAO, Semidefinite programming for the graph partitioning problem, Discrete Applied Math., to appear.
34. Y. YE, Approximating Quadratic Programming with Bound and Quadratic Constraints, Math. Programming, 84 (1999), pp. 219-226.
35. Y. YE, Interior Point Algorithms: Theory and Analysis, Wiley-Intersci. Ser. Discrete Math. Optim., John Wiley, New York, 1997.
36. Q. ZHAO, Semidefinite Programming for Assignment and Partitioning Problems, Ph.D. thesis, University of Waterloo, ON, Canada, 1996.
37. Q. ZHAO, S. E. KARISCH, F. RENDL, AND H. WOLKOWICZ, Semidefinite programming relaxations for the quadratic assignment problems, J. Combin. Optim., 2 (1998), pp. 71-109.