On the gap between the quadratic integer programming problem and its semidefinite relaxation

Mathematical Programming

Volumn 107, Issue 3, 2006, Pages 505-515

  Malik, U ^a   Jaimoukha, I M ^a   Halikias, G D ^b   Gungah, S K ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b CITY UNIVERSITY   (United Kingdom)

Author keywords

Hyperplane arrangements; Linear matrix inequalities; Quadratic integer programming; Semidefinite relaxation; Zonotopes

Indexed keywords

FUNCTIONS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

HYPERPLANE ARRANGEMENTS; LINEAR MATRIX INEQUALITIES; QUADRATIC INTEGER PROGRAMMING; SEMIDEFINITE RELAXATION; ZONOTOPES;

INTEGER PROGRAMMING;

EID: 33645319187     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0692-2     Document Type: Article

References (26)

1. Alizadeh, F.: Combinatorial optimization with semidefinite matrices. In: Proceedings of the second annual integer programming and combinatorial optimization conference, Carnegie-Mellon University, 1992
2. Allemand, K., Fukuda, K., Liebling, T.M., Steiner, E.: A polynomial case of unconstrained zero-one quadratic optimization. Math. Prog., Ser. A 91, 49-52 (2001)
3. Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65, 21-46 (1996)
4. Balas, E., Ceria, S., Cornuejols, G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Prog. 58, 295-324 (1993)
5. Buck, R.C.: Partition of space. Amer. Math. Monthly 50, 541-544 (1943)
6. Delorme, C., Poljak, S.: Laplacian eigenvalues and the maximum-cut problem. Math. Prog. 62 (3), 557-574 (1993)
7. Edelsbrunner, H.: Algorithms in combinatorial geometry. Springer Verlag, 1987
8. Edelsbrunner, H., O'Rourke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications. SLAM J. Comput. 15 (2), 341-363 (1986)
9. Ferrez, J.A., Fukuda, K., Liebling, T.M.: Cuts, zonotopes and arrangements. In: Festschrift, P (ed.), The sharpest Cut. SIAM Series on Optimization, 2001
10. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, CA, 1979
11. Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42 (6), 1115-1145 (1995)
12. Gungah, S.K., Halikias, G.D., Jaimoukha, I.M.: Maximally robust controllers for multivariable systems. SIAM J. Control and Optimization 38 (6), 1805-1829 (2000)
13. Gungah, S.K., Malik, U., Jaimoukha, I.M., Halikias, G.D.: A new upper bound for the real structured singular value. In: Proceedings IEEE Conference Dec. & Control, 2001, pp. 247-248
14. Lovasz, L., Shrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optimization 1(2), 166-190 (1991)
15. Malik, U.: New bounds for the structured singular value. PhD thesis, Imperial College, University of London, 2003
16. Nesterov, Y.: Semidefinite relaxation and nonconvex quadratic optimization. Optim. Method. Softw. 9 (1-3), 141-160 (1998)
17. Nesterov, Yu., Nemirovskii, A.: Interior-point polynomial methods in convex programming. SIAM, Philadelphia, PA, 1994
18. Onn, S., Schulman, L.J.: The vector partition problem for convex objective functions. Math. Oper. Res. 26 (3), 583-590 (2001)
19. Poljak, S., Rendl, F., Wolkowics, H.: A recipe for semidefinite relaxation for (0, 1)-quadratic programming. J. Global Optim. 7 (1), 51-73 (1995)
20. Poljak, S., Wolkowics, H.: Convex relaxation of (0, 1)-quadratic programming. Math. Oper. Res. 20 (3), 550-561 (1995)
21. Della Riccia, G., Shapiro, A.: Minimum rank and minimum trace of covariance matrices. Psychometrika 47, 443-448 (1982)
22. Shapiro, A.: Extremal problems on the set of nonnegative definite matrices. Lin. Alg. Appl. 67, 7-18 (1985)
23. ten Berge, J.M.F., Snijders, T.A.B., Zegers, F.E.: Computational aspects of the greatest lower bound to the reliability and constrained minimum trace factor analysis. Psychometrika 46, 201-213 (1981)
24. Wolkowizs, H., Saigal, R., Vandenberghe, L.: Handbook of semidefinite programming: theory, algorithms and applications. Kluwer Academic Publishers, Boston, 2000
25. Zaslavsky, T.: Facing up to arrangements: face-count formulas for partitions of space by hyperplanes. Mem. Amer. Math. Soc. 154 (5), 585-600 (1975)
26. Zhang, J.W., Ye, Y.Y., Han, Q.M.: Improved approximations for max set splitting and max NAE SAT. Discrete Appl. Math. 142 (1-3), 133-149 (2004)