Second-order cone relaxations for binary quadratic polynomial programs

SIAM Journal on Optimization

Volumn 21, Issue 1, 2011, Pages 391-414

  Ghaddar, Bissan ^a   Vera, Juan C ^b   Anjos, Miguel F ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b TILBURG UNIVERSITY   (Netherlands)

^c GERAD   (Canada)

Author keywords

Binary quadratic polynomial program; Polynomial programming; Second order cone; Sum of squares

Indexed keywords

COMPUTATIONAL COSTS; COMPUTATIONAL TESTS; NONCONVEX; POLYNOMIAL PROGRAMMING; QUADRATIC KNAPSACK PROBLEMS; QUADRATIC POLYNOMIAL; RELAXATION SCHEMES; SECOND-ORDER CONE; SECOND-ORDER CONE PROGRAMMING; SEMI-DEFINITE PROGRAMMING; SUM OF SQUARES;

COMPUTATIONAL EFFICIENCY; INTEGER PROGRAMMING; PROBLEM SOLVING;

POLYNOMIALS;

EID: 79957474703     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/100802190     Document Type: Article

References (41)

1. B. ALIDAEE, G. KOCHENBERGER, AND A. AHMADIAN, 0-1 quadratic programming approach for the optimal solution of two scheduling problems, Internat. J. Systems Sci., 25 (1994), pp. 401-408.
2. M. F. ANJOS, A. KENNINGS, AND A. VANNELLI, A semidefinite optimization approach for the single-row layout problem with unequal dimensions, Discrete Optim., 2 (2005), pp. 113-122. (Pubitemid 41023719)
3. F. BARAHONA, M. JÜNGER, AND G. REINELT, Experiments in quadratic 0-1 programming, Math. Program., 44 (1989), pp. 127-137.
4. E. BOROS AND P. HAMMER, Pseudo-boolean optimization, Discrete Appl. Math., 123 (2002), pp. 155-225.
5. E. BOROS AND A. PREKOPA, Probabilistic bounds and algorithms for the maximum satisfiability problem, Ann. Oper. Res., 21 (1989), pp. 109-126.
6. S. BURER, private communication, 2009.
7. S. BURER, R. MONTEIRO, AND Y. ZHANG, Rank-two relaxation heuristics for max-cut and other binary quadratic programs, SIAM J. Optim., 12 (2002), pp. 503-521.
8. E. DE KLERK AND D. PASECHNIK, Approximation of the stability number of a graph via copositive programming, SIAM J. Optim., 12 (2002), pp. 875-892.
9. K. FUJISAWA, M. KOJIMA, AND K. NAKATA, Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Math. Program., 79 (1997), pp. 235-253. (Pubitemid 127397729)
10. G. GALLO, P. HAMMER, AND B. SIMEONE, Quadratic knapsack problems, European J. Oper. Res., 12 (1980), pp. 132-149.
11. M. GRÖTSCHEL, M. JÜNGER, AND G. REINELT, An application of combinatorial optimization to statistical physics and circuit layout design, Oper. Res., 36 (1988), pp. 493-513. (Pubitemid 18655113)
12. C. HELMBERG, F. RENDL, AND R. WEISMANTEL, A semidefinite programming approach to the quadratic knapsack problem, J. Comb. Optim., 4 (2000), pp. 197-215.
13. E. L. JOHNSON, A. MEHROTRA, AND G. L. NEMHAUSER, Min-cut clustering, Math. Program., 62 (1993), pp. 133-151.
14. S. KIM AND M. KOJIMA, Second-order cone programming relaxation of nonconvex quadratic optimization problems, Optim. Methods Softw., 15 (2001), pp. 201-224. (Pubitemid 33817509)
15. S. KIM AND M. KOJIMA, Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations, Comput. Optim. Appl., 26 (2003), pp. 143-154.
16. S. KIM, M. KOJIMA, AND M. YAMASHITA, Second order cone programming relaxation of a positive semidefinite constraint, Optim. Methods Softw., 18 (2003), pp. 535-541.
17. M. KOJIMA, S. KIM, AND H. WAKI, A general framework for convex relaxation of polynomial optimization problems over cones, J. Oper. Res. Soc. Japan, 46 (2003), pp. 125-144. (Pubitemid 38972212)
18. J. LASSERRE, An explicit equivalent positive semidefinite program for nonlinear 0-1 programs, SIAM J. Optim., 12 (2001), pp. 756-769.
19. J. LASSERRE, Global optimization problems with polynomials and the problem of moments, SIAM J. Optim., 11 (2001), pp. 796-817.
20. D. LAUGHHUNN, Quadratic binary programming with application to capital-budgeting problems, Oper. Res., 18 (1970), pp. 454-461.
21. M. LAURENT, Semidefinite representations for finite varieties, Math. Program., 109 (2007), pp. 1-26. (Pubitemid 44874464)
22. E. LAWLER, The quadratic assignment problem, Management Sci., 9 (1963), pp. 586-599.
23. L. LOVÁSZ AND A. SCHRIJVER, Cones of matrices and set-functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
24. T. S. MOTZKIN, The arithmetic-geometric inequality, in Inequalities (Proceedings of Symposium Wright Patterson Air Force Base, Ohio, 1965), Academic Press, New York, 1967, pp. 205-224.
25. Y. NESTEROV, Semidefinite relaxation and non-convex quadratic optimization, Optim. Methods Softw., 12 (1997), pp. 1-20.
26. P. PARDALOS AND G. RODGERS, Computational aspects of a branch and bound algorithm for quadratic zero-one programming, Computing, 45 (1990), pp. 131-144.
27. P. PARRILO, Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization, Ph. D. thesis, Department of Control and Dynamical Systems, California Institute of Technology, Pasadena, CA, 2000.
28. P. PARRILO, An Explicit Construction of Distinguished Representations of Polynomials Nonnegative over Finite Sets, Technical report, IfA Technical Report AUT02-02, Zurich, Switzerland, 2002.
29. P. PARRILO, Semidefinite programming relaxations for semialgebraic problems, Math. Program., 96 (2003), pp. 293-320. (Pubitemid 44757842)
30. P. PARRILO AND B. STURMFELS, Minimizing polynomial functions, algorithmic and quantitative real algebraic geometry, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., 60 (2003), pp. 83-89.
31. J. F. PEÑA, J. C. VERA, AND L. F. ZULUAGA, Exploiting equalities in polynomial programming, Oper. Res. Lett., 36, 2008.
32. A. PHILLIPS AND J. ROSEN, A quadratic assignment formulation of the molecular conformation problem, J. Global Optim., 4 (1994), pp. 229-241.
33. D. PISINGER, The quadratic knapsack problem-a survey, Discrete Appl. Math., 155 (2007), pp. 623-648. (Pubitemid 46209321)
34. I. PÓLIK AND T. TERLAKY, A survey of the S-lemma, SIAM Rev., 49 (2007), pp. 371-418. (Pubitemid 47377690)
35. M. PUTINAR, Positive polynomials on compact semi-algebraic sets, Indiana Univ. Math. J., 42 (1993), pp. 969-984.
36. N. SHOR, A class of global minimum bounds of polynomial functions, Cybernetics, 23 (1987), pp. 731-734.
37. J. STURM, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optim. Methods Softw., 1999, pp. 11-12.
38. B. STURMFELS, J. DEMMEL, AND J. NIE, Minimizing polynomials via sum of squares over the gradient ideal, Math. Program., 106 (2006), pp. 587-606.
39. J. C. VERA, L. ZULUAGA, AND J. PEÑA, Positive polynomials on equality constrained domains, working paper.
40. H. WOLKOWICZ, R. SAIGAL, AND L. VANDENBERGHE, Handbook of Semidefinite Programming-Theory, Algorithms, and Applications, Springer, New York, 2000.
41. L. ZULUAGA, J. C. VERA, AND J. PEÑA, LMI approximations for cones of positive semidefinite forms, SIAM J. Optim., 16, 2006, pp. 1076-1091. (Pubitemid 44729412)