Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations

Mathematical Programming

Volumn 124, Issue 1-2, 2010, Pages 383-411

  Saxena, Anureet ^a   Bonami, Pierre ^b   Lee, Jon ^c  

^a Axioma Inc   (United States)

^b AIX MARSEILLE UNIVERSITY   (France)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESULTS; CONSTRAINED PROGRAMMING; CONVEX QUADRATIC CONSTRAINTS; CONVEX RELAXATION; CUTTING PLANE ALGORITHMS; DISJUNCTIVE PROGRAMMING; EIGENVALUES; EIGENVECTORS; EXTENDED FORMULATIONS; INTEGER VARIABLES; LIFT-AND-PROJECT; MATRIX; MIXED INTEGER; NON-CONVEX CONSTRAINTS; VALID INEQUALITY;

COMPUTATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; RELAXATION PROCESSES;

INTEGER PROGRAMMING;

EID: 77955175439     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0371-9     Document Type: Article

References (37)

1. Anstreicher, K.M.: Semidefinite Programming versus the Reformulation-Linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming. Pre-print, Optimization Online, May 2007
2. E. Balas 1998 Disjunctive programming: properties of the convex hull of feasible points Discrete Appl. Math. 89 1-3 3 44 0921.90118 10.1016/S0166- 218X(98)00136-X 1663099
3. E. Balas S. Ceria G. Cornuéjols 1993 A lift-and-project cutting plane algorithm for mixed 0-1 programs Math. Program. 58 1-3 295 324 10.1007/BF01581273
4. Balas, E.: Projection and lifting in combinatorial optimization. In: Juenger, M., Naddef, D. (eds.) Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions, Lecture Notes in Computer Science, vol. 2241, pp. 26-56. Springer (2001)
5. E. Balas A. Saxena 2008 Optimizing over the split closure Math. Program. 113 2 219 240 1135.90030 10.1007/s10107-006-0049-5 2375481 (Pubitemid 351177970)
6. E. Balas J. Tama J. Tind 1989 Sequential convexification in reverse convex and disjunctive programming Math. Program. 44 1-3 337 350 0683.90063 10.1007/BF01587096 1028227
7. P. Bonami L.T. Biegler A.R. Conn G. Cornuéjols I.E. Grossmann C.D. Laird J. Lee A. Lodi F. Margot N. Sawaya A. Wächter 2008 An algorithmic framework for convex mixed-integer nonlinear programs Discrete Optim. 5 186 204 1151.90028 10.1016/j.disopt.2006.10.011 2408416 (Pubitemid 351443148)
8. S. Burer D. Vandenbussche 2008 A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations Math. Program. 113 3 259 282 1135.90034 10.1007/s10107-006-0080-6 2375483 (Pubitemid 351177972)
9. G. Cornuéjols 2007 Revival of the Gomory cuts in the 1990's Ann. Oper. Res. 149 1 63 66 10.1007/s10479-006-0100-1 2313362
10. C. Delorme S. Poljak 1993 Laplacian eigenvalues and the maximum cut problem Math. Program. Ser. A 62 3 557 574 10.1007/BF01585184 1251892
11. M. Fischetti A. Lodi 2007 Optimizing over the first Chvátal closure Math. Program. 110 1 3 20 05145050 10.1007/s10107-006-0054-8 2306128 (Pubitemid 46411827)
12. Fletcher, R., Leyffer, S.: User Manual for FilterSQP. Numerical Analysis Report NA/181, Dundee University (1998)
13. GLOBALLib, www.gamsworld.org/global/globallib/globalstat.htm
14. M.X. Goemans D.P. Williamson 1995 Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming J. ACM 42 6 1115 1145 0885.68088 10.1145/227683.227684 1412228
15. Helmberg, C., Poljak, S., Rendl, F., Wolkowicz, H.: Combining semidefinite and polyhedral relaxations for integer programs. Integer programming and combinatorial optimization (Copenhagen, 1995), Lecture Notes in Comput. Sci., 920, pp. 124-134. Springer, Berlin (1995)
16. R.G. Jeroslow 1973 There cannot be any algorithm for integer programming with quadratic constraints Oper. Res. 21 1 221 224 0257.90029 10.1287/opre.21.1.221 354007
17. S. Kim M. Kojima 2001 Second order cone programming relaxation of nonconvex quadratic optimization problems Optim. Methods Softw. 15 201 204 1109.90327 10.1080/10556780108805819 1892585
18. M. Laurent S. Poljak 1995 On a positive semidefinite relaxation of the cut polytope. Special issue honoring Miroslav Fiedler and Vlastimil Ptk Linear Algebra Appl. 223/224 439 461 10.1016/0024-3795(95)00271-R 1340705
19. M. Laurent S. Poljak 1996 On the facial structure of the set of correlation matrices SIAM J. Matrix Anal. Appl. 17 3 530 547 0855.15011 10.1137/0617031 1397243
20. S. Lee I.E. Grossmann 2001 A global optimization algorithm for nonconvex generalized disjunctive programming and applications to process systems Comput. Chem. Eng. 25 1675 1697 10.1016/S0098-1354(01)00732-3
21. T. Matsui 1996 NP-hardness of linear multiplicative programming and related problems J. Glob. Optim. 9 113 119 0868.90111 10.1007/BF00121658 1411603
22. G.P. McCormick 1976 Computability of global solutions to factorable nonconvex programs: part I Convex underestimating problems Math. Program. 10 1 147 175 0349.90100 10.1007/BF01580665 469281
23. PENNON, http://www.penopt.com
24. Saxena, A., Bonami, P., Lee, J.: Disjunctive cuts for non-convex mixed integer quadratically constrained problems. In: Lodi, A., Panconesi, A., Rinaldi, G., (eds.) Integer programming and combinatorial optimization (Bertinoro, 2008), Lecture Notes in Computer Science, vol. 5035, pp. 17-33. Springer, Heidelberg (2008)
25. Saxena, A., Bonami, P., Lee, J.: Convex relaxations of mixed integer quadratically constrained programs: extended formulations. IBM Research Report RC24621, 08/2008. Available on Optimization Online
26. Saxena, A., Bonami, P., Lee, J.: Convex relaxations of mixed integer quadratically constrained programs: projected formulations. IBM Research Report RC24695, 11/2008. Available on Optimization Online
27. Saxena, A., Goyal, V., Lejeune, M.: MIP reformulations of the probabilistic set covering problem. Math. Program. (to appear)
28. S. Sen 1992 Relaxations for probabilistically constrained programs with discrete random variables Oper. Res. Lett. 11 2 81 86 0765.90071 10.1016/0167-6377(92)90037-4 1167427
29. Sherali H.D., Adams W.P.: A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Kluwer, Boston (1998)
30. H.D. Sherali B.M.P. Fraticelli 2002 Enhancing RLT relaxations via a new class of semidefinite cuts J. Glob. Optim. 22 233 261 1045.90044 10.1023/A:1013819515732 1878144
31. R. Stubbs S. Mehrotra 1999 A branch-and-cut method for 0-1 mixed convex programming Math. Program. 86 515 532 0946.90054 10.1007/s101070050103 1733745
32. J.F. Sturm 1999 Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones Optim. Methods Softw. 11-12 625 653 10.1080/10556789908805766 1778433
33. Tawarmalani M., Sahinidis N.V.: Convexification and global optimization in continuous and mixed-integer nonlinear programming: theory, algorithms, software, and applications. Kluwer, Boston (2002)
34. M. Tawarmalani N.V. Sahinidis 2004 Global optimization of mixed integer nonlinear programs: A theoretical and computational study Math. Program. 99 3 563 591 1062.90041 10.1007/s10107-003-0467-6 2051712 (Pubitemid 40871718)
35. D. Vandenbussche G.L. Nemhauser 2005 A polyhedral study of nonconvex quadratic programs with box constraints Math. Program. 102 3 531 557 1137.90009 10.1007/s10107-004-0549-0 2136226 (Pubitemid 40536653)
36. D. Vandenbussche G.L. Nemhauser 2005 A branch-and-cut algorithm for nonconvex quadratic programs with box constraints Math. Program. 102 3 559 575 1137.90010 10.1007/s10107-004-0550-7 2136227 (Pubitemid 40536654)
37. A. Wächter L.T. Biegler 2006 On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming Math. Program. 106 1 25 57 1134.90542 10.1007/s10107-004-0559-y 2195616 (Pubitemid 41813168)