Semidefinite programming for discrete optimization and matrix completion problems

Discrete Applied Mathematics

Volumn 123, Issue 1-3, 2002, Pages 513-577

  Wolkowicz, Henry ^a   F Anjos, Miguel ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Discrete optimization; Euclidean distance matrix; Lagrangian relaxation; Matrix completion problem; Max cut problem; Semidefinite programming

Indexed keywords

LAGRANGE MULTIPLIERS;

DISCRETE OPTIMIZATION; EUCLIDEAN DISTANCE MATRICES; LAGRANGIAN RELAXATION; MATRIX COMPLETION PROBLEMS; MAX-CUT PROBLEM; SEMI-DEFINITE PROGRAMMING;

OPTIMIZATION;

EID: 84867957035     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00352-3     Document Type: Article

References (122)

1. A. Alfakih, A. Khandani, H. Wolkowicz, Solving Euclidean distance matrix completion problems via semidefinite programming, Comput. Optim. Appl. 12(1-3) (1999) 13-30 (Computational optimization - a tribute to Olvi Mangasarian, Part I).
2. A. Alfakih, and H. Wolkowicz Matrix completion problems H. Wolkowicz, R. Saigal, L. Vandenberghe, Handbook of semidefinite programming: Theory, Algorithms, and Applications 2000 Kluwer Academic Publishers Boston, MA 533 545
3. A. Alfakih, H. Wolkowicz, A new semidefinite programming model for large sparse Euclidean distance matrix completion problems, Technical Report CORR 2000-37, University of Waterloo, Waterloo, Canada, 2000, in progress.
4. F. Alizadeh, Combinatorial optimization with interior point methods and semidefinite matrices, Ph.D. Thesis, University of Minnesota, 1991.
5. F. Alizadeh Interior point methods in semidefinite programming with applications to combinatorial optimization SIAM J. Optim. 5 1995 13 51
6. F. Alizadeh, J.-P. Haeberly, M.V. Nayakkankuppam, M.L. Overton, S. Schmieta, SDPpack user's guide - version 0.9 Beta, Technical Report TR1997-737, Courant Institute of Mathematical Sciences, NYU, New York, NY, June 1997.
7. M.F. Anjos, New convex relaxations for the maximum cut and VLSI layout problems, Ph.D. Thesis, University of Waterloo, 2001.
8. M.F. Anjos, H. Wolkowicz, Geometry of semidefinite max-cut relaxations via matrix ranks, J. Combin. Optim., to appear.
9. M.F. Anjos, H. Wolkowicz, A strengthened SDP relaxation via a second lifting for the Max-Cut problem, Discrete Appl. Math., to appear.
10. K.M. Anstreicher, Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem, Technical Report, University of Iowa, Iowa City, IA, 1999.
11. K.M. Anstreicher, X. Chen, H. Wolkowicz, and Y. Yuan Strong duality for a trust-region type relaxation of the quadratic assignment problem Linear Algebra Appl. 301 1-3 1999 121 136
12. K.M. Anstreicher, and H. Wolkowicz On Lagrangian relaxation of quadratic matrix constraints SIAM J. Matrix Anal. Appl. 22 1 2000 41 55
13. M. Bakonyi, and C.R. Johnson The Euclidean distance matrix completion problem SIAM J. Matrix Anal. Appl. 16 2 1995 646 654
14. M. Bakonyi, and G. Naevdal On the matrix completion method for multidimensional moment problems Acta Sci. Math. (Szeged) 64 3-4 1998 547 558
15. W.W. Barrett, C.R. Johnson, M. Lundquist, Determinantal formulae for matrix completions associated with chordal graphs, Linear Algebra Appl. 121 (1989) 265-289 (Linear algebra and applications, Valencia, 1987).
16. A. Barvinok, On convex properties of the quadratic image of the sphere, Technical Report, University of Michigan, 1999.
17. S.J. Benson, Y. Ye, and X. Zhang Solving large-scale sparse semidefinite programs for combinatorial optimization SIAM J. Optim. 10 2 2000 443 461 (electronic)
18. R. Bhatia Perturbation Bounds for Matrix Eigenvalues Pitman Research Notes in Mathematics Series Vol. 162 1987 Longman New York
19. B. Borchers, CSDP, a C library for semidefinite programming, Optim. Methods Softw. 11/12 (1-4) (1999) 613-623 (Interior point methods).
20. B. Borchers, SDPLIB 1.2, a library of semidefinite programming test problems, Optim. Methods Softw. 11(1) (1999) 683-690 (Interior point methods).
21. S. Burer, R.D.C. Monteiro, A projected gradient algorithm for solving the maxcut SDP relaxation, Optimization Methods and Software 15 (2001) 175-200.
22. C.C. Choi, Y. Ye, Application of semidefinite programming to circuit partitioning, Technical Report, The University of Iowa, Iowa City, IW, 1999.
23. N. Cohen, and J. Dancis Maximal rank Hermitian completions of partially specified Hermitian matrices Linear Algebra Appl. 244 1996 265 276
24. G.M. Crippen, and T.F. Havel Distance Geometry and Molecular Conformation 1988 Wiley New York
25. J. Dancis Positive semidefinite completions of partial Hermitian matrices Linear Algebra Appl. 175 1992 97 114
26. A. Edelman, T. Arias, S.T. Smith, The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20(2) (1999) 303-353 (electronic).
27. S.M. Fallat, C.R. Johnson, R.L. Smith, The general totally positive matrix completion problem with few unspecified entries, Electron. J. Linear Algebra 7 (2000) 1-20 (electronic).
28. P.A. Fillmore, and J.P. Williams Some convexity theorems for matrices Glasgow Math. J. 10 1971 110 117
29. F. Forgó Nonconvex Programming 1988 Akadémiai Kiadó Budapest
30. T. Fujie, and M. Kojima Semidefinite programming relaxation for nonconvex quadratic programs J. Global Optim. 10 4 1997 367 380
31. K. Fujisawa, M. Kojima, K. Nakata, SDPA semidefinite programming algorithm, Technical Report, Dept. of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1995.
32. K. Fujisawa, M. Kojima, and K. Nakata Exploiting sparsity in primal-dual interior-point methods for semidefinite programming Math. Programming B 79 1997 235 253
33. K. Fukuda, M. Kojima, K. Murota, K. Nakata, Exploiting sparsity in semidefinite programming via matrix completion I: general framework, Technical Report B-358, Dept. of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1999.
34. J.F. Geelen Maximum rank matrix completion Linear Algebra Appl. 288 1-3 1999 211 217
35. W. Glunt, T.L. Hayden, C.R. Johnson, and P. Tarazaga Positive definite completions and determinant maximization Linear Algebra Appl. 288 1-3 1999 1 10
36. M.X. Goemans Semidefinite programming in combinatorial optimization Math. Programming 79 1997 143 162
37. M.X. Goemans, Semidefinite programming and combinatorial optimization, Documenta Math. (Extra Volume ICM) 1998 (1998) 657-666 (Invited talk at the International Congress of Mathematicians, Berlin, 1998).
38. 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
39. 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
40. I. Gohberg, M.A. Kaashoek, and F. Van schagen Partially Specified Matrices and Operators: Classification, Completion, Applications 1995 Birkhäuser Verlag, Basel
41. B. Grone, C.R. Johnson, E. Marquês de Sa, and H. Wolkowicz Positive definite completions of partial Hermitian matrices Linear Algebra Appl. 58 1984 109 124
42. S.W. Hadley, F. Rendl, and H. Wolkowicz A new lower bound via projection for the quadratic assignment problem Math. Oper. Res. 17 3 1992 727 739
43. W. Haemers On some problems of Lovász concerning the Shannon capacity of graphs IEEE Trans. Inform. Theory 25 1979 231 232
44. T.L. Hayden, R. Reams, and J. Wells Methods for constructing distance matrices and the inverse eigenvalue problem Linear Algebra Appl. 295 1-3 1999 97 112
45. C. Helmberg, An interior-point method for semidefinite programming and max-cut bounds, Ph.D. Thesis, Graz University of Technology, Austria, 1994.
46. 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
47. C. Helmberg, and F. Rendl A spectral bundle method for semidefinite programming SIAM J. Optim. 10 3 2000 673 696
48. 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
49. B. Hendrickson, The molecule problem: Determining conformation from pairwise distances, Ph.D. Thesis, Cornell University, Ithaca, New York, 1991.
50. B. Hendrickson The molecule problem: exploiting structure in global optimization SIAM J. Optim. 5 4 1995 835 857
51. L. Hogben Completions of inverse M-matrix patterns Linear Algebra Appl. 282 1-3 1998 145 160
52. L. Hogben Completions of M-matrix patterns Linear Algebra Appl. 285 1-3 1998 143 152
53. S. Homer, M. Peinado, In the performance of polynomial-time clique algorithms on very large graphs, Technical Report, Boston University, Boston, MA, 1994.
54. R.A. Horn, C.R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1990 (Corrected reprint of the 1985 original).
55. C.R. Johnson, Matrix completion problems: a survey, Matrix Theory and Applications, Phoenix, AZ, 1989, Amer. Math. Soc., Providence, RI, 1990, pp. 171-198.
56. C.R. Johnson, B. Kroschel, and H. Wolkowicz An interior-point method for approximate positive semidefinite completions Comput. Optim. Appl. 9 2 1998 175 190
57. C.R. Johnson, and B.K. Kroschel The combinatorially symmetric P-matrix completion problem Electron. J. Linear Algebra 1 electronic 1996 59 63
58. C.R. Johnson, and L. Rodman Inertia possibilities for completions of partial Hermitian matrices Linear Multilinear Algebra 16 1-4 1984 179 195
59. C.R. Johnson, L. Rodman, Chordal inheritance principles and positive definite completions of partial matrices over function rings, Contributions to Operator Theory and its Applications, Mesa, AZ, 1987, Birkhäuser, Basel, 1988, pp. 107-127.
60. C.R. Johnson, and R.L. Smith The symmetric inverse M-matrix completion problem Linear Algebra Appl. 290 1-3 1999 193 212
61. C.R. Johnson, and P. Tarazaga Connections between the real positive semidefinite and distance matrix completion problems (special issue honoring Miroslav Fiedler and Vlastimil Pták) Linear Algebra Appl. 223/224 1995 375 391
62. C.R. Johnson, and P. Tarazaga Approximate semidefinite matrices in a subspace SIAM J. Matrix Anal. Appl. 19 4 1999 861 871
63. S.E. Karisch, F. Rendl, H. Wolkowicz, Trust regions and relaxations for the quadratic assignment problem, Quadratic Assignment and Related Problems, New Brunswick, NJ, 1993, Amer. Math. Soc., Providence, RI, 1994, pp. 199-219.
64. D.E. Knuth, The sandwich theorem, Electron. J. Combin. 1 (1994) 48pp.
65. M. Kojima, S. Kojima, S. Hara, Linear algebra for semidefinite programming, Technical Report 1004, Dept. of Information Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1997 (Linear matrix inequalities and positive semidefinite programming, Kyoto, 1996 (Japanese)).
66. M. Kojima, L. Tunçel, Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization problems, Technical Report CORR98-34, Dept. of Combinatorics and Optimization, University of Waterloo, 1998.
67. M. Kojima, L. Tunçel, Cones of matrices and successive convex relaxations of nonconvex sets, SIAM J. Optim. 10 (2000) 750-778.
68. M. Kojima, L. Tunçel, On the finite convergence of successive convex relaxation methods, Technical Report CORR99-36, Dept. of Combinatorics and Optimization, University of Waterloo, 1999.
69. F. Körner A tight bound for the Boolean quadratic optimization problem and its use in a branch and bound algorithm Optimization 19 5 1988 711 721
70. F. Körner Remarks on a difficult test problem for quadratic Boolean programming Optimization 26 1992 355 357
71. S. Kruk, Semidefinite programming applied to nonlinear programming, Master's Thesis, University of Waterloo, 1996.
72. S. Kruk, M. Muramatsu, F. Rendl, R.J. Vanderbei, and H. Wolkowicz The Gauss-Newton direction in linear and semidefinite programming Optim. Methods Softw. 15 1 2001 1 27
73. 2 p, sequential quadratic constrained quadratic programming, Advances in Nonlinear Programming, Beijing, 1996, Kluwer Acad. Publ., Dordrecht, 1998, pp. 177-204.
74. J.B. Lasserre, Optimality conditions and lmi relaxations for 0-1 programs, Laas Research Report, LAAS-CNRS, Toulouse, France, 2000.
75. M. Laurent Cuts, matrix completions and graph rigidity Math. Programming 79 1997 255 284
76. M. Laurent A connection between positive semidefinite and Euclidean distance matrix completion problems Linear Algebra Appl. 273 1998 9 22
77. M. Laurent, A tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems, 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.
78. M. Laurent, Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems, SIAM J. Matrix Anal. Appl. 22 (2000) 874-894.
79. C. Lemaréchal, F. Oustry, Semidefinite relaxations and Lagrangian duality with application to combinatorial optimization, Technical Report, Institut National de Recherche en Informatique et en Automatique, INRIA, St Martin, France, 1999.
80. M. Littman, D.F. Swayne, N. Dean, A. Buja, Visualizing the embedding of objects in Euclidean space, Technical Report, Bellcore, Morristown, NJ 07962-1910, 1999.
81. L. Lovász, and A. Schrijver Cones of matrices and set-functions and 0-1 optimization SIAM J. Optim. 1 2 1991 166 190
82. D.G. Luenberger Optimization by Vector Space Methods 1969 Wiley New York
83. Z-Q. Luo, S. Zhang, On the extension of Frank-Wolfe theorem, Technical Report, Erasmus University Rotterdam, The Netherlands, 1997.
84. R. Mathias Matrix completions, norms and Hadamard products Proc. Amer. Math. Soc. 117 4 1993 905 918
85. S. Mizuno, M.J. Todd, and Y. Ye On adaptive-step primal-dual interior-point algorithms for linear programming Math. Oper. Res. 18 4 1993 964 981
86. B. Mohar, and S. Poljak Eigenvalues in combinatorial optimization, Combinatorial Graph-Theoretical Problems in Linear Algebra, IMA Vol. 50 1993 Springer Berlin
87. R.D.C. Monteiro Primal-dual path-following algorithms for semidefinite programming SIAM J. Optim. 7 3 1997 663 678
88. R.D.C. Monteiro, P.R. Zanjácomo, Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants, Technical Report, Georgia Tech, Atlanta, GA, 1997.
89. J.J. Moré, and Z. Wu Distance geometry optimization for protein structures J. Global Optim. 15 3 1999 219 234
90. Y.E. Nesterov, Quality of semidefinite relaxation for nonconvex quadratic optimization, Technical Report, CORE, Universite Catholique de Louvain, Belgium, 1997.
91. Y.E. Nesterov, A.S. Nemirovski, Optimization over Positive Semidefinite Matrices: Mathematical Background and User's Manual, USSR Acad. Sci. Centr. Econ. & Math. Inst., 32 Krasikova St., Moscow 117418 USSR, 1990.
92. Y.E. Nesterov, and A.S. Nemirovski Interior Point Polynomial Algorithms in Convex Programming 1994 SIAM Publications, SIAM Philadelphia, USA
93. Y.E. Nesterov, and M.J. Todd Self-scaled barriers and interior-point methods for convex programming Math. Oper. Res. 22 1 1997 1 42
94. 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 361 420
95. M. Newman Matrix completion theorems Proc. Amer. Math. Soc. 94 1 1985 39 45
96. M.L. Overton, and R.S. Womersley Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices Math. Programming 62 2, Ser. B 1993 321 357
97. P. Pardalos, F. Rendl, H. Wolkowicz, The quadratic assignment problem: a survey and recent developments. in: P. Pardalos, H. Wolkowicz, (Eds.), Quadratic Assignment and Related Problems, New Brunswick, NJ, 1993. Amer. Math. Soc., Providence, RI, 1994, pp. 1-42.
98. P.M. Pardalos, and S.A. Vavasis Quadratic programming with one negative eigenvalue is NP-hard J. Global Optim. 1 1 1991 15 22
99. B.N. Parlett, The Symmetric Eigenvalue Problem, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1998 (Corrected reprint of the 1980 original).
100. 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
101. S. Poljak, and H. Wolkowicz Convex relaxations of (0,1)-quadratic programming Math. Oper. Res. 20 3 1995 550 561
102. A.J. Quist, E. de Klerk, C. Roos, and T. Terlaky Copositive relaxation for general quadratic programming (special issue Celebrating the 60th Birthday of Professor Naum Shor) Optim. Methods Softw. 9 1998 185 208
103. M.V. Ramana, An algorithmic analysis of multiquadratic and semidefinite programming problems, Ph.D. Thesis, Johns Hopkins University, Baltimore, MD, 1993.
104. M.V. Ramana, L. Tunçel, and H. Wolkowicz Strong duality for semidefinite programming SIAM J. Optim. 7 3 1997 641 662
105. F. Rendl Semidefinite programming and combinatorial optimization Appl. Numer. Math. 29 1999 255 281
106. F. Rendl, H. Wolkowicz, A projection technique for partitioning the nodes of a graph, Ann. Oper. Res. 58 (1995) 155-179 (Applied mathematical programming and modeling, II (APMOD 93), Budapest, 1993).
107. F. Rendl, and H. Wolkowicz A semidefinite framework for trust region subproblems with applications to large scale minimization Math. Programming 77 2, Ser. B 1997 273 299
108. A. Schrijver A comparison of the Delsarte and Lovász bounds IEEE Trans. Inform. Theory IT-25 1979 425 429
109. N.Z. Shor Quadratic optimization problems Izv. Akad. Nauk SSSR Tekhn. Kibernet. 222 1 1987 128 139222
110. R. Stern, and H. Wolkowicz Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations SIAM J. Optim. 5 2 1995 286 313
111. J.F. Sturm Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones Optim. Methods Softw. 11/12 1-4 1999 625 653
112. M.J. Todd A study of search directions in primal-dual interior-point methods for semidefinite programming Optim. Methods Softw. 11&12 1999 1 46
113. M.J. Todd, K.C. Toh, R.H. Tutuncu, A MATLAB software package for semidefinite programming, Technical Report, School of OR and IE, Cornell University, Ithaca, NY, 1996.
114. M.W. Trosset Applications of multidimensional scaling to molecular conformation Comput. Sci. Statist. 29 1998 148 152
115. L. Tunçel, S. Xu, Complexity analyses of discretized successive convex relaxation methods, Technical Report CORR 99-37, Department of Combinatorics and Optimization, Waterloo, Ont., 1999.
116. L. Vandenberghe, S. Boyd, and S.-P. Wu Determinant maximization with linear matrix inequality constraints SIAM J. Matrix Anal. Appl. 19 2 1998 499 533
117. C.P. Wells, An improved method for sampling of molecular conformation space, Ph.D. Thesis, University of Kentucky, 1995.
118. H. Wolkowicz, R. Saigal, L. Vandenberghe (Eds.), Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, Kluwer Academic Publishers, Boston, MA, 2000, xxvi+654 pages.
119. V.A. Yakubovich The S-procedure and duality theorems for nonconvex problems of quadratic programming Vestnik Leningrad. Univ. 1973 1 1973 81 87
120. Y. Ye, A new complexity result on minimization of a quadratic function with a sphere constraint, Recent Advances in Global Optimization, Princeton University Press, Princeton, 1992, pp. 19-31.
121. Y. Ye Approximating quadratic programming with bound and quadratic constraints Math. Programming 84 1999 219 226
122. Q. Zhao, S.E. Karisch, F. Rendl, H. Wolkowicz, Semidefinite programming relaxations for the quadratic assignment problem, J. Combin. Optim. 2 (1) (1998) 71-109 (Semidefinite programming and interior-point approaches for combinatorial optimization problems, Toronto, ON, 1996).