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

Mathematical Programming

Volumn 130, Issue 2, 2011, Pages 359-413

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

^a Axioma Inc   (United States)

^b CNRS   (France)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESULTS; CONVEX RELAXATION; DISJUNCTIVE PROGRAMMING; EXTENDED FORMULATIONS; GENERATION TECHNIQUES; HIGHER-DIMENSIONAL; LIFT-AND-PROJECT; LINEAR PROGRAMS; MIXED INTEGER; PROJECTION TECHNIQUES; QUADRATIC CONSTRAINT; QUADRATIC FORM; SDP RELAXATION; STUDY METHODS;

NUMBER THEORY; RELAXATION PROCESSES;

INTEGER PROGRAMMING;

EID: 81155129151     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0340-3     Document Type: Article

References (29)

1. Abhishek, K., Leyffer, S., Linderoth, J.T.: Filmint: An outer-approximation-based solver for nonlinear mixed integer programs. Preprint ANL/MCS-P1374-0906, Argonne National Laboratory, Mathematics and Computer Science Division, Argonne, IL (2006)
2. E. Balas 1998 Disjunctive programming: properties of the convex hull of feasible points Discret. Appl. Math. 89 1-3 3 44 1663099 0921.90118 10.1016/S0166-218X(98)00136-X (Pubitemid 128400151)
3. E. Balas S. Ceria G. Cornuéjols 1993 A lift-and-project cutting plane algorithm for mixed 0-1 programs Math. Program. 58 295 324 0796.90041 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, Heidelberg (2001) (Pubitemid 33369826)
5. E. Balas A. Saxena 2008 Optimizing over the split closure Math. Program. 113 2 219 240 2375481 1135.90030 10.1007/s10107-006-0049-5 (Pubitemid 351177970)
6. Belotti, P., Lee, J., Liberti, L., Margot, F., Wächter, A.: Branching and bounds tightening techniques for non-convex MINLP, IBM Research Report RC24620, 08/2008
7. A. Ben-Tal A. Nemirovski 2001 On polyhedral approximations of the second-order cone Math. Oper. Res. 26 193 205 1895823 1082.90133 10.1287/moor.26.2.193.10561 (Pubitemid 34047211)
8. 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 Discret. Optim. 5 186 204 1151.90028 10.1016/j.disopt.2006.10.011 (Pubitemid 351443148)
9. S. Burer R.D.C. Monteiro 2003 A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization Math. Program. (series B) 95 329 357 1976484 1030.90077 10.1007/s10107-002-0352-8 (Pubitemid 44757858)
10. Couenne, http://projects.coin-or.org/Couenne
11. GLOBALLib, http://www.gamsworld.org/global/globallib/globalstat.htm
12. Jones, C.N., Kerrigan, E.C., Maciejowski, J.M.: Equality set projection: a new algorithm for the projection of polytopes in halfspace representation. CUED Technical Report CUED/F-INFENG/TR.463
13. S. Kim M. Kojima 2001 Second order cone programming relaxation of nonconvex quadratic optimization problems Optim. Methods Softw. 15 201 204 1892585 1109.90327 10.1080/10556780108805819
14. 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
15. T. Matsui 1996 NP-hardness of linear multiplicative programming and related problems J. Glob. Optim. 9 113 119 1411603 0868.90111 10.1007/BF00121658 (Pubitemid 126714003)
16. 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
17. J.L. Nazareth 1991 The homotopy principle and algorithms for linear programming SIAM J. Optim. 1 316 332 1112523 0757.90053 10.1137/0801021
18. Rendl F., Rinaldi G., Wiegele A.: A branch and bound algorithm for Max-Cut based on combining semidefinite and polyhedral relaxations. In: Fischetti, M., Williamson, D.P. (eds) Integer Programming and Combinatorial Optimization (Cornell 2007). Lecture Notes in Computer Science, vol. 4513, pp. 295-309. Springer, Berlin (2007)
19. 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, Berlin (2008)
20. Saxena, A., Bonami, P., Lee, J.: Convex relaxations of mixed integer quadratically constrained programs: extended formulations, IBM Research Report RC24621, 08/2008
21. Saxena, A., Goyal, V., Lejeune, M.: MIP Reformulations of the probabilistic set covering problem, To appear in Mathematical Programming
22. S. Sen 1992 Relaxations for probabilistically constrained programs with discrete random variables Oper. Res. Lett. 11 2 81 86 1167427 0765.90071 10.1016/0167-6377(92)90037-4
23. Sherali H.D., Adams W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Dordecht (1998)
24. R. Stubbs S. Mehrotra 1999 A branch-and-cut method for 0-1 mixed convex programming Math. Program. 86 515 532 1733745 0946.90054 10.1007/s101070050103
25. D. Vandenbussche G.L. Nemhauser 2005 A polyhedral study of nonconvex quadratic programs with box constraints Math. Program. 102 3 531 556 2136226 1137.90009 10.1007/s10107-004-0549-0 (Pubitemid 40536653)
26. D. Vandenbussche G.L. Nemhauser 2005 A branch-and-cut algorithm for nonconvex quadratic programs with box constraints Math. Program. 102 3 559 575 2136227 1137.90010 10.1007/s10107-004-0550-7 (Pubitemid 40536654)
27. J.P. Vielma S. Ahmed G.L. Nemhauser 2008 A lifted linear programming branch-and-bound algorithm for mixed integer conic quadratic programs Inf. J. Comput. 20 438 450 2437210 10.1287/ijoc.1070.0256
28. 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 2195616 1134.90542 10.1007/s10107-004- 0559-y (Pubitemid 41813168)
29. 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