Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons

Mathematical Programming

Volumn 129, Issue 1, 2011, Pages 129-157

  Bao, Xiaowei ^a   Sahinidis, Nikolaos V ^b   Tawarmalani, Mohit ^c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c PURDUE UNIVERSITY   (United States)

Author keywords

Lagrangian relaxation; Nonconvex optimization; Quadratic programming; Semidefinite programming

Indexed keywords

COMPUTATIONAL COMPARISONS; COMPUTATIONAL TIME; CONSTRAINED QUADRATIC PROGRAMMING; FIRST-ORDER; LAGRANGIAN RELAXATION; NON-LINEAR CONSTRAINTS; NONCONVEX OPTIMIZATION; SDP RELAXATION; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMS; SEMIDEFINITE RELAXATION; THREE ORDERS OF MAGNITUDE;

COMBINATORIAL OPTIMIZATION; CONSTRAINED OPTIMIZATION; LAGRANGE MULTIPLIERS; MATHEMATICAL PROGRAMMING;

QUADRATIC PROGRAMMING;

EID: 80052586194     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-011-0462-2     Document Type: Article

References (50)

1. N. Adhya M. Tawarmalani N.V. Sahinidis 1999 A Lagrangian approach to the pooling problem Ind. Eng. Chem. 38 1956 1972 10.1021/ie980666q (Pubitemid 29236727)
2. F.A. Al-Khayyal 1992 Generalized bilinear programming: Part I. Models, applications and linear programming relaxation Eur. J. Oper. Res. 60 306 314 0784.90051 10.1016/0377-2217(92)90082-K
3. F.A. Al-Khayyal J.E. Falk 1983 Jointly constrained biconvex programming Math. Oper. Res. 8 273 286 707057 0521.90087 10.1287/moor.8.2.273
4. F.A. Al-Khayyal C. Larsen T. Van Voorhis 1995 A relaxation method for nonconvex quadratically constrained quadratic programs J. Global Optim. 6 215 230 1327189 0835.90060 10.1007/BF01099462
5. Anstreicher, K., Burer, S.: Computable representations for convex hulls of low-dimensional quadratic forms. http://www.dollar.biz.uiowa.edu/~sburer/ papers/023-qphull.pdf (2007)
6. K.M. Anstreicher 2009 Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming J. Global Optim. 43 471 484 2471898 1169.90425 10.1007/s10898-008-9372-0
7. K.M. Anstreicher S. Burer 2005 DC versus copositive bounds for standard QP J. Global Optim. 33 2 299 312 2192210 1093.90033 10.1007/s10898-004-4312-0 (Pubitemid 41618777)
8. X. Bao N.V. Sahinidis M. Tawarmalani 2009 Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs Optim. Methods Softw. 24 485 504 2554897 1179.90252 10.1080/10556780902883184
9. Ben-Tal, A., Nemirovski, A.S.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2001)
10. Benson, S.J., Ye, Y.: DSDP5: Software for semidefinite programming. Tech. Rep. ANL/MCS-P1289-0905, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL. ACM Trans. Math. Softw. http://www.mcs.anl. gov/~benson/dsdp (submitted, 2005)
11. I.M. Bomze E. de Klerk 2002 Solving standard quadratic optimization problems via linear, semidefinite and copositive programming J. Global Optim. 24 163 185 1934026 1047.90038 10.1023/A:1020209017701 (Pubitemid 35168547)
12. I.M. Bomze M. Dur E. de Klerk C. Roos A.J. Quist T. Terlaky 2000 On copositive programming and standard quadratic optimization problems J. Global Optim. 18 4 301 320 1810401 0970.90057 10.1023/A:1026583532263
13. I.M. Bomze F. Frommlet M. Rubey 2007 Improved SDP bounds for minimizing quadratic functions over the l(1)-ball Optim. Lett. 1 1 49 59 2357607 1135.90377 10.1007/s11590-006-0018-1
14. I.M. Bomze M. Locatelli F. Tardella 2008 New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability Math. Program. 115 1 31 64 2403752 1171.90007 10.1007/s10107-007-0138-0 (Pubitemid 351702151)
15. B. Borchers 1999 CSDP, A C library for semidefinite programming Optim. Methods Softw. 11 613 623 1778432 10.1080/10556789908805765
16. Brooke A., Kendrick D., Meeraus A.: GAMS-A User's Guide. The Scientific Press, Redwood City, CA (1988)
17. Burer, S.: Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Tech. rep., University of Iowa, Iowa City, IA. http://www.optimization-online.org/DB-FILE/2009/01/2184.pdf (2008)
18. S. Burer 2009 On the copositive representation of binary and continuous nonconvex quadratic programs Math. Program. 120 2 295 479 2505747 10.1007/s10107-008-0223-z
19. Burer, S., Chen, J.: Relaxing the optimality conditions of box QP. Tech. rep., Dept. of Management Sciences, University of Iowa, Iowa City, IA 52240. Available at http://www.optimization-online.org/DB-FILE/2007/10/1815.pdf (2007)
20. S. Burer D. Vandenbussche 2008 A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations Math. Program. 112 259 282 2375483 10.1007/s10107-006-0080-6 (Pubitemid 351177972)
21. M.C. Dorneich N.V. Sahinidis 1995 Global optimization algorithms for chip layout and compaction Eng. Optim. 25 131 154 10.1080/03052159508941259
22. T. Fujie M. Kojima 1997 Semidefinite programming relaxation for nonconvex quadratic programs J. Global Optim. 10 367 380 1457183 0881.90101 10.1023/A:1008282830093 (Pubitemid 127502196)
23. M.X. Goemans D.P. Williamson 1995 Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming J. ACM 42 1115 1145 1412228 0885.68088 10.1145/227683.227684
24. E.P. Hao 1982 Quadratically constrained quadratic programming: some applications and a method for solution Math. Methods Oper. Res. 26 105 119 0479.90065
25. J. Linderoth 2005 A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs Math. Program. 103 251 282 2146380 1099.90039 10.1007/s10107-005-0582-7 (Pubitemid 40878750)
26. M.L. Liu N.V. Sahinidis 1997 Process planning in a fuzzy environment Eur. J. Oper. Res. 100 142 169 0947.90608 10.1016/S0377-2217(96)00025-2 (Pubitemid 127414916)
27. M. Locatelli U. Raber 2002 Packing equal circles in a square: a deterministic global optimization approach Discret. Appl. Math. 122 139 166 1907828 1019.90033 10.1016/S0166-218X(01)00359-6 (Pubitemid 34548371)
28. G.P. McCormick 1976 Computability of global solutions to factorable nonconvex programs: Part I-Convex underestimating problems Math. Program. 10 147 175 469281 0349.90100 10.1007/BF01580665
29. H.D. Mittelmann 2003 An independent benchmarking of SDP and SOCP solvers Math. Program. 95 407 430 1976487 1030.90080 10.1007/s10107-002-0355-5 (Pubitemid 44757861)
30. I. Nowak 1999 A new semidefinite programming bound for indefinite quadratic forms over a simplex J. Global Optim. 14 357 364 1707796 0959.65077 10.1023/A:1008315627883 (Pubitemid 129617301)
31. I. Pólik T. Terlaky 2007 A survey of the S-Lemma SIAM Rev. 49 371 418 2353804 1128.90046 10.1137/S003614450444614X (Pubitemid 47377690)
32. S. Poljak F. Rendl H. Wolkowicz 1995 A recipe for semidefinite relaxation for (0,1)-quadratic programming J. Global Optim. 7 1 51 73 1342935 0843.90088 10.1007/BF01100205
33. A.J. Quist E. de Klerk C. Roos T. Terlaky 1998 Copositive relaxations for general quadratic programming Optim. Methods Softw. 9 185 208 1618092 0904.90126 10.1080/10556789808805692 (Pubitemid 128542196)
34. A.D. Rikun 1997 A convex envelope formula for multilinear functions J. Global Optim. 10 425 437 1457187 0881.90099 10.1023/A:1008217604285 (Pubitemid 127502200)
35. Rockafellar R.T.: Convex Analysis Princeton. Mathematical Series. Princeton University Press, Princeton (1970)
36. H.D. Sherali 1997 Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets Acta Mathematica Vietnamica 22 245 270 1479749 0914.90205
37. H.D. Sherali 2007 RLT: a unified approach for discrete and continuous nonconvex optimization Ann. Oper. Res. 149 1 185 193 2313377 1213.90029 10.1007/s10479-006-0107-7
38. N.Z. Shor 1987 Quadratic optimization problems Soviet J. Comput. Syst. Sci. 25 1 11 939596 0655.90055
39. N.Z. Shor 1990 Dual quadratic estimates in polynomial and Boolean programming Ann. Oper. Res. 25 163 168 1084428 0783.90081 10.1007/BF02283692
40. N.Z. Shor 1992 Dual estimates in multiextremal problems J. Global Optim. 2 411 418 1263608 0765.90072 10.1007/BF00122430
41. A. Sutou Y. Dai 2002 Global optimization approach to unequal sphere packing problems in 3D J. Optim. Theory Appl. 114 671 694 1921172 1026.90078 10.1023/A:1016083231326 (Pubitemid 39587619)
42. M. Tawarmalani N.V. Sahinidis 2005 A polyhedral branch-and-cut approach to global optimization Math. Program. 103 225 249 2146379 1099.90047 10.1007/s10107-005-0581-8 (Pubitemid 40878749)
43. T. Van Voorhis 2002 A global optimization algorithm using lagrangian underestimates and the interval Newton method J. Global Optim. 24 349 370 1932387 1046.90067 10.1023/A:1020383700229 (Pubitemid 35254533)
44. S.A. Vavasis 1990 Quadratic programming is in NP Inf. Process. Lett. 36 73 77 1079809 0719.90052 10.1016/0020-0190(90)90100-C
45. Wolkowicz, H.: Semidefinite and lagrangian relaxations for hard combinatorial problems. In: Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization, pp. 269-310. Kluwer, B.V., Deventer, The Netherlands (2000)
46. H. Wolkowicz 2002 A note on lack of strong duality for quadratic problems with orthogonal constraints Eur. J. Oper. Res. 143 2 356 364 1940977 1058.90046 10.1016/S0377-2217(02)00295-3 (Pubitemid 34991906)
47. H. Wolkowicz M.F. Anjos 2002 Semidefinite programming for discrete optimization and matrix completion problems Discret. Appl. Math. 123 1-3 513 577 1922345 1060.90059 10.1016/S0166-218X(01)00352-3 (Pubitemid 34775584)
48. Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Theory, Algorithms, and Applications. Kluwer (2000)
49. W. Xie N.V. Sahinidis 2008 A branch-and-bound algorithm for the continuous facility layout problem Comput. Chem. Eng. 32 1016 1028 10.1016/j.compchemeng.2007.05.003 (Pubitemid 351199688)
50. M. Yamashita K. Fujisawa M. Kojima 2003 Implementation and evaluation of SDPA 6.0 (SemiDefinite Programming Algorithm 6.0) Optim. Methods Softw. 18 491 505 2019042 1106.90366 10.1080/1055678031000118482