Intersection Cuts for Polynomial Optimization

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11480)


We consider dynamically generating linear constraints (cutting planes) to tighten relaxations for polynomial optimization problems. Many optimization problems have feasible set of the form \(S \cap P\), where S is a closed set and P is a polyhedron. Integer programs are in this class and one can construct intersection cuts using convex “forbidden” regions, or S-free sets. Here, we observe that polynomial optimization problems can also be represented as a problem with linear objective function over such a feasible set, where S is the set of real, symmetric matrices representable as outer-products of the form \(xx^T\). Accordingly, we study outer-product-free sets and develop a thorough characterization of several (inclusion-wise) maximal intersection cut families. In addition, we present a cutting plane approach that guarantees polynomial-time separation of an extreme point in \(P\setminus S\) using our outer-product-free sets. Computational experiments demonstrate the promise of our approach from the point of view of strength and speed.



We would like to thank the anonymous reviewers for their valuable comments. This research was partly supported by award ONR N00014-16-1-2889, Conicyt Becas Chile 72130388 and The Institute for Data Valorisation (IVADO).


  1. 1.
    Andersen, K., Louveaux, Q., Weismantel, R.: An analysis of mixed integer linear sets based on lattice point free convex sets. Math. Oper. Res. 35(1), 233–256 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Inequalities from two rows of a simplex tableau. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 1–15. Springer, Heidelberg (2007). Scholar
  3. 3.
    Anstreicher, K.M.: Semidefinite programming versus the reformulation linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43, 471–484 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Atamtürk, A., Narayanan, V.: Conic mixed-integer rounding cuts. Math. Program. 122, 1–20 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Averkov, G.: On finite generation and infinite convergence of generalized closures from the theory of cutting planes. arXiv preprint arXiv:1106.1526 (2011)
  6. 6.
    Balas, E.: Intersection cuts—a new type of cutting planes for integer programming. Oper. Res. 19(1), 19–39 (1971)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Bao, X., Sahinidis, N.V., Tawarmalani, M.: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs. Optim. Methods Softw. 24(4–5), 485–504 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Basu, A., Conforti, M., Cornuéjols, G., Zambelli, G.: Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. 35(3), 704–720 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Basu, A., Conforti, M., Cornuéjols, G., Zambelli, G.: Minimal inequalities for an infinite relaxation of integer programs. SIAM J. Discrete Math. 24(1), 158–168 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Belotti, P., Góez, J.C., Pólik, I., Ralphs, T.K., Terlaky, T.: On families of quadratic surfaces having fixed intersections with two hyperplanes. Discrete Appl. Math. 161(16–17), 2778–2793 (2013)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Bienstock, D., Michalka, A.: Cutting-planes for optimization of convex functions over nonconvex sets. SIAM J. Optim. 24, 643–677 (2014)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Bienstock, D., Chen, C., Muñoz, G.: Outer-product-free sets for polynomial optimization and oracle-based cuts. arXiv preprint arXiv:1610.04604 (2016)
  13. 13.
    Bonami, P., Günlük, O., Linderoth, J.: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. Math. Program. Comput. 10(3), 333–382 (2018)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Borozan, V., Cornuéjols, G.: Minimal valid inequalities for integer constraints. Math. Oper. Res. 34(3), 538–546 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Burer, S.: Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Math. Program. Comput. 2(1), 1–19 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Chen, C., Atamtürk, A., Oren, S.S.: A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables. Math. Program. 165(2), 549–577 (2017)MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Conforti, M., Cornuéjols, G., Daniilidis, A., Lemaréchal, C., Malick, J.: Cut-generating functions and S-free sets. Math. Oper. Res. 40(2), 276–391 (2014)MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Cornuéjols, G., Wolsey, L., Yıldız, S.: Sufficiency of cut-generating functions. Math. Program. 152, 1–9 (2013)MathSciNetzbMATHGoogle Scholar
  19. 19.
    Dax, A.: Low-rank positive approximants of symmetric matrices. Adv. Linear Algebra Matrix Theory 4(3), 172–185 (2014)CrossRefGoogle Scholar
  20. 20.
    Dey, S.S., Wolsey, L.A.: Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 463–475. Springer, Heidelberg (2008). Scholar
  21. 21.
    Dey, S.S., Wolsey, L.A.: Constrained infinite group relaxations of MIPs. SIAM J. Optim. 20(6), 2890–2912 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    Eckart, C., Young, G.: The approximation of one matrix by another of lower rank. Psychometrika 1(3), 211–218 (1936)zbMATHCrossRefGoogle Scholar
  23. 23.
    Fischetti, M., Ljubić, I., Monaci, M., Sinnl, M.: A new general-purpose algorithm for mixed-integer bilevel linear programs. Oper. Res. 65(6), 1615–1637 (2017)MathSciNetzbMATHCrossRefGoogle Scholar
  24. 24.
    Floudas, C.A., et al.: Handbook of Test Problems in Local and Global Optimization, vol. 33. Springer, Boston (2013). Scholar
  25. 25.
    Freund, R.M., Orlin, J.B.: On the complexity of four polyhedral set containment problems. Math. Program. 33(2), 139–145 (1985)MathSciNetzbMATHCrossRefGoogle Scholar
  26. 26.
    Ghaddar, B., Vera, J.C., Anjos, M.F.: A dynamic inequality generation scheme for polynomial programming. Math. Program. 156(1–2), 21–57 (2016)MathSciNetzbMATHCrossRefGoogle Scholar
  27. 27.
    Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra. Math. Program. 3(1), 23–85 (1972)MathSciNetzbMATHCrossRefGoogle Scholar
  28. 28.
    Guennebaud, G., Jacob, B., et al.: Eigen v3 (2010).
  29. 29.
    Hillestad, R.J., Jacobsen, S.E.: Reverse convex programming. Appl. Math. Optim. 6(1), 63–78 (1980)MathSciNetzbMATHCrossRefGoogle Scholar
  30. 30.
    Kılınç-Karzan, F.: On minimal valid inequalities for mixed integer conic programs. Math. Oper. Res. 41(2), 477–510 (2015)MathSciNetzbMATHCrossRefGoogle Scholar
  31. 31.
    Kocuk, B., Dey, S.S., Sun, X.A.: Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem. Math. Program. Comput. 10(4), 557–596 (2018)MathSciNetzbMATHCrossRefGoogle Scholar
  32. 32.
    Krishnan, K., Mitchell, J.E.: A unifying framework for several cutting plane methods for semidefinite programming. Optim. Methods Softw. 21, 57–74 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  33. 33.
    Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796–817 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  34. 34.
    Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, pp. 157–270. Springer, New York (2009). Scholar
  35. 35.
    Locatelli, M., Schoen, F.: On convex envelopes for bivariate functions over polytopes. Math. Program. 144, 1–27 (2013)MathSciNetzbMATHGoogle Scholar
  36. 36.
    Lovász, L.: Geometry of numbers and integer programming. In: Mathematical Programming: Recent Developments and Applications, pp. 177–210 (1989)Google Scholar
  37. 37.
    Luedtke, J., Namazifar, M., Linderoth, J.: Some results on the strength of relaxations of multilinear functions. Math. Program. 136(2), 325–351 (2012)MathSciNetzbMATHCrossRefGoogle Scholar
  38. 38.
    McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I - convex underestimating problems. Math. Program. 10(1), 147–175 (1976)zbMATHCrossRefGoogle Scholar
  39. 39.
  40. 40.
    Mirsky, L.: Symmetric gauge functions and unitarily invariant norms. Q. J. Math. 11(1), 50–59 (1960)MathSciNetzbMATHCrossRefGoogle Scholar
  41. 41.
    Misener, R., Floudas, C.A.: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations. Math. Program. 136(1), 155–182 (2012)MathSciNetzbMATHCrossRefGoogle Scholar
  42. 42.
    Modaresi, S., Kılınç, M.R., Vielma, J.P.: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets. Math. Program. 155, 1–37 (2015)MathSciNetzbMATHGoogle Scholar
  43. 43.
    MOSEK ApS: The MOSEK Fusion API for C++ (2018).
  44. 44.
    Qualizza, A., Belotti, P., Margot, F.: Linear programming relaxations of quadratically constrained quadratic programs. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, pp. 407–426. Springer, New York (2012). Scholar
  45. 45.
    Rikun, A.D.: A convex envelope formula for multilinear functions. J. Glob. Optim. 10(4), 425–437 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  46. 46.
    Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. Math. Program. 124, 383–411 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  47. 47.
    Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. 130, 359–413 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  48. 48.
    Sen, S., Sherali, H.D.: Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization. Math. Program. 37(2), 169–183 (1987)MathSciNetzbMATHCrossRefGoogle Scholar
  49. 49.
    Sherali, H.D., Fraticelli, B.M.P.: Enhancing RLT relaxations via a new class of semidefinite cuts. J. Glob. Optim. 22, 233–261 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  50. 50.
    Shor, N.Z.: Quadratic optimization problems. Sov. J. Circ. Syst. Sci. 25, 6 (1987)MathSciNetGoogle Scholar
  51. 51.
    Tardella, F.: Existence and sum decomposition of vertex polyhedral convex envelopes. Optim. Lett. 2, 363–375 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  52. 52.
    Tawarmalani, M., Richard, J.P.P., Xiong, C.: Explicit convex and concave envelopes through polyhedral subdivisions. Math. Program. 138, 1–47 (2013)MathSciNetzbMATHCrossRefGoogle Scholar
  53. 53.
    Tawarmalani, M., Sahinidis, N.V.: Convex extensions and envelopes of lower semi-continuous functions. Math. Program. 93, 247–263 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  54. 54.
    Tuy, H.: Concave programming under linear constraints. Sov. Math. 5, 1437–1440 (1964)zbMATHGoogle Scholar
  55. 55.
    Vandenbussche, D., Nemhauser, G.: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3), 559–575 (2005)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.IEORColumbia UniversityNew YorkUSA
  2. 2.ISEThe Ohio State UniversityColumbusUSA
  3. 3.IVADO FellowPolytechnique MontréalMontrealCanada

Personalised recommendations