Semidefinite programming and combinatorial optimization

Applied Numerical Mathematics

Volumn 29, Issue 3, 1999, Pages 255-281

  Rendl, Franz ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Combinatorial optimization; Integer programs; Linear programs over cones; Nonlinear relaxations; Semidefinite programming

Indexed keywords

EID: 0000334878     PISSN: 01689274     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-9274(98)00097-X     Document Type: Article

References (64)

1. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim. 5 (1995) 13-51.
2. F. Alizadeh, J.A. Haeberly and M.L. Overton, Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. Technical Report 721, New York University (1996).
3. N. Alon and N. Kahale, A spectral technique for coloring random 3-colorable graphs, in: Proceedings 26th Symposium on the Theory of Computer Science (1994) 346-353.
4. N. Alon and N. Kahale, Approximating the independence number via the theta function, Technical Report, Tel Aviv University (1995).
5. D. Avis and V.P. Grishukhin, A bound on the k-gonality of the hypermetric cone and related complexity problems, Comput. Geom. Theory Appl. 2 (1993) 241-254.
6. A. Ben-Israel, A. Charnes and K.O. Kortanek, Duality and asymptotic solvability over cones, Bull. AMS 75 (1969) 318-324.
7. 0.2143)-coloring algorithm for 3-colorable graphs, Inform. Process. Lett. 61 (1997) 49-53.
8. S. Boyd, L. El Ghaoui, E. Feron and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, SIAM Studies in Applied Mathematics, Vol. 15 (SIAM, Philadelphia, PA, 1994).
9. J. Cullum, W.E. Donath and P. Wolfe, The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices, Math. Programming 3 (1975) 35-55.
10. D.M. Cvetkovic, M. Doob and H. Sachs, Spectra of Graphs (J.A. Barth, Heidelberg/Leipzig, 3rd ed., 1995).
11. C. Delorme and S. Poljak, Laplacian eigenvalues and the Max-Cut problem, Math. Programming 63 (1993) 557-574.
12. M. Deza, M. Grishuchin and M. Laurent, The hypermetric cone is polyhedral, Combinatorica 13 (1993) 397-411.
13. W.E. Donath and A.J. Hoffman, Lower bounds for the partitioning of graphs, IBM J. Res. Develop. 17 (1973) 420-425.
14. R.J. Duffin, Infinite programs, in: H.W. Kuhn and A.W. Tucker, eds., Linear Inequalities and Related Systems, Annals of Mathematical Studies, Vol. 38 (Princeton University Press, 1956) 157-170.
15. J. Falkner, F. Rendl and H. Wolkowicz, A computational study of graph partitioning, Math. Programming 66 (1994) 211-239.
16. P.A. Fillmore and J.P. Williams, Some convexity theorems for matrices, Glasgow Math. J. 12 (1971) 110-117.
17. R. Fletcher, Practical Methods of Optimization (Wiley, New York, 2nd ed., 1987).
18. A. Frieze and M. Jerrum, Improved approximation algorithms for max k-cut and max bisection, Algorithmica 18 (1997) 67-81.
19. K. Fujisawa, M. Koshima and K. Nakata, Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Technical Report B-324, Tokyo Institute of Technology (1997).
20. W. Gander, Least squares with a quadratic constraint, Numer. Math. 36 (1981) 291-307.
21. M.X. Goemans, Semidefinite programming in combinatorial optimization, Math. Programming 79 (1997) 143-161.
22. M.X. Goemans and D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (1995) 1115-1145.
23. J. Hastad, Some optimal inapproximability results, in: Proceedings 29th Symposium on the Theory of Computer Science (1997) 1-10.
24. C. Helmberg, An interior point method for semidefinite programming and max-cut bounds, Ph.D. Thesis, Graz University of Technology (October 1994).
25. C. Helmberg, S. Poljak, F. Rendl and H. Wolkowicz, Combining semidefinite and polyhedral relaxations for integer programs, in: Lecture Notes in Computer Science 920 (Springer, New York, 1995) 124-134.
26. C. Helmberg and F. Rendl, Solving quadratic (0, 1)-problems by semidefinite programming and cutting planes, Working paper, TU Graz (1995); to appear in Math. Programming.
27. C. Helmberg and F. Rendl, A spectral bundle method for semidefinite programming, Working paper, TU Graz (1997); to appear in SIAM J. Optim.
28. C. Helmberg, F. Rendl, R.J. Vanderbei and H. Wolkowicz, An interior point method for semidefinite programming, SIAM J. Optim. 6 (1996) 342-361.
29. J.-B. Hiriart-Urruty and C. Lemaréchal, Convex Analysis and Minimization Algorithms 1, Grundlagen der Mathematischen Wissenschaften, Vol. 305 (Springer, New York, 1993).
30. F. Juhász, On the spectrum of a random graph, in: L. Lovász and V.T. Sós, eds., Algebraic Methods in Graph Theory, Colloq. Math. Soc. János Bolyai, Vol. 15 (North-Holland, Amsterdam, 1982) 313-316.
31. D. Karger and R. Motwani and M. Sudan, Approximate graph coloring by semidefinite programming, in: Proceedings 35th Symposium on Foundations of Computer Science (1994) 2-13.
32. S.E. Karisch, Nonlinear approaches to quadratic assignment and graph partition problems, Ph.D. Thesis, Graz University of Technology (1995).
33. S.E. Karisch and F. Rendl, Semidefinite programming and graph equipartition, in: P.M. Pardalos and H. Wolkowicz, eds., Topics in Semidefinite and Interior-Point Methods, Fields Institute Communications, Vol. 18 (Amer. Math. Soc., Providence, RI, 1998) 77-95.
34. H. Karloff, How good is the Goemans-Williamson MAX-CUT algorithm? in: Proceedings 28th Symposium on the Theory of Computer Science (1996) 427-434.
35. M. Kojima, S. Shindoh and S. Hara, Interior-point methods for the monotone linear complementarity problem in symmetric matrices, SIAM J. Optim. 7 (1997) 86-125.
36. S. Kruk, M. Muramatsu, F. Rendl, R.J. Vanderbei and H. Wolkowicz, The Gauss-Newton direction in semidefinite programming, Working Paper, University of Waterloo (1998).
37. 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.
38. L. Lovász, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory 25 (1979) 1-7.
39. L. Lovász, Semidefinite programs and combinatorial optimization, Lecture notes (1995).
40. Z.Q. Luo, J.F. Sturm and S. Zhang, Duality and self-duality for conic convex programming, Technical Report, Erasmus University, Rotterdam (1996).
41. B. Mohar, Some applications of Laplace eigenvalues of graphs, in: G. Hahn and G. Sabidussi, eds., Graph Symmetry (Kluwer, Dordrecht, 1997) 225-275.
42. B. Mohar and S. Poljak, Eigenvalues in combinatorial optimization, in: R.A. Brualdi, S. Friedland and V. Klee, eds., Combinatorial and Graph-Theoretical Problems in Linear Algebra, The IMA Volumes in Mathematics and Its Applications, Vol. 50 (Springer, Berlin, 1993) 107-151.
43. R.D.C. Monteiro, Primal-dual path following algorithms for semidefinite programming, SIAM J. Optim. 7 (1997) 663-678.
44. Y.E. Nesterov and A.S. Nemirovskii, Interior Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics, Vol. 13 (SIAM, Philadelphia, PA, 1994).
45. Y.E. Nesterov and M.J. Todd, Primal-dual interior-point methods for self-scaled cones, Technical Report TR-1125, Cornell University, Ithaca, NY (1995).
46. M.L. Overton, Large-scale optimization of eigenvalues, SIAM J. Optim. 2 (1992) 88-120.
47. M.L. Overton and R.S. Wommesley, On the sum of the largest eigenvalues of a symmetric matrix, SIAM J. Matrix Anal. Appl. 13 (1992) 41-45.
48. S. Poljak, Duality over nonpolyhedral cones, Manuscript (Passau, 1994).
49. S. Poljak and F. Rendl, Solving the Max-Cut problem using eigenvalues, Discrete Appl. Math. 62 (1995) 249-278.
50. S. Poljak and F. Rendl, Node and edge relaxations of the Max-Cut problem, Computing 52 (1994) 123-137.
51. S. Poljak and F. Rendl, Nonpolyhedral relaxations of graph bisection problems, SIAM J. Optim. 5 (1995) 467-487.
52. S. Poljak, F. Rendl and H. Wolkowicz, A recipe for semidefinite relaxations of (0, 1) quadratic programming, J. Global Optim. 7 (1995) 51-73.
53. S. Poljak and S. Tuza, Maximum cuts and large bipartite subgraphs, DIMACS Series in Discrete Mathematics 20 (1995) 181-244.
54. S. Poljak and H. Wolkowicz, Convex relaxations of (0, 1) quadratic programming, Math. Oper. Res. 20 (1995) 550-561.
55. F. Rendl and H. Wolkowicz, A projection technique for partitioning the nodes of a graph, Ann. Oper. Res. 58 (1995) 155-179.
56. F. Rendl and H. Wolkowicz, A semidefinite framework for trust region subproblems with application to large scale minimization, Math. Programming 77 (1997) 273-299.
57. G. Rinaldi, RUDY: a generator for random graphs, IASI, Rome (1996).
58. R. Stern and H. Wolkowicz, Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations, SIAM J. Optim. 5 (1995) 286-313.
59. M.J. Todd, K.C. Toh and R.H. Tütüncü, On the Nesterov-Todd direction in semidefinite programming, Technical Report, Cornell University, Ithaca, NY (1996).
60. M. Ujvari, Simple proofs of duality theorems in semidefinite and cone-linear programming, Eötvös University, Budapest (1996).
61. L. Vandenberghe and S. Boyd, Positive definite programming, SIAM Rev. 38 (1996) 49-95.
62. H. Wolkowicz, Some applications of optimization in matrix theory, Linear Algebra Appl. 40 (1981) 101-118.
63. Y. Zhang, On extending primal-dual interior-point algorithms from linear programming to semidefinite programming, Technical Report TR95-20, University of Maryland (1995).
64. Q. Zhao, Semidefinite programming for assignment and partition problems, Ph.D. Thesis, University of Waterloo (1996).