Advertisement

High Degree Sum of Squares Proofs, Bienstock-Zuckerberg Hierarchy and CG Cuts

  • Monaldo MastrolilliEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10328)

Abstract

Chvátal-Gomory (CG) cuts captures useful and efficient linear programs that the bounded degree Lasserre/Sum-of-Squares (\({\textsc {sos}}\)) hierarchy fails to capture. We present an augmented version of the \({\textsc {sos}}\) hierarchy for 0/1 integer problems that implies the Bienstock-Zuckerberg hierarchy by using high degree polynomials (when expressed in the standard monomial basis). It follows that for a class of polytopes (e.g. set covering and packing problems), the \({\textsc {sos}}\) approach can optimize, up to an arbitrarily small error, over the polytope resulting from any constant rounds of CG cuts in polynomial time.

Keywords

Packing Problem Valid Inequality Symmetric Polynomial Invariant Polynomial High Degree Polynomial 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Au, Y.H., Tunçel, L.: Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators. arXiv preprint arXiv:1608.07647 (2016)
  2. 2.
    Bansal, N.: Hierarchies reading group. http://www.win.tue.nl/nikhil/hierarchies/
  3. 3.
    Bienstock, D., Zuckerberg, M.: Subset algebra lift operators for 0-1 integer programming. SIAM J. Optim. 15(1), 63–95 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bienstock, D., Zuckerberg, M.: Approximate fixed-rank closures of covering problems. Math. Program. 105(1), 9–27 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Blekherman, G., Parrilo, P.A., Thomas, R.R.: Semidefinite Optimization and Convex Algebraic Geometry, vol. 13. Siam, Philadelphia (2013)zbMATHGoogle Scholar
  6. 6.
    Conforti, M., Cornuejols, G., Zambelli, G.: Integer Programming. Springer Publishing Company, Incorporated (2014)CrossRefzbMATHGoogle Scholar
  7. 7.
    Fawzi, H., Saunderson, J., Parrilo, P.A.: Equivariant semidefinite lifts and sum-of-squares hierarchies. SIAM J. Optim. 25(4), 2212–2243 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Gatermann, K., Parrilo, P.A.: Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192(1), 95–128 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Karlin, A.R., Mathieu, C., Nguyen, C.T.: Integrality gaps of linear and semi-definite programming relaxations for knapsack. In: Günlük, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 301–314. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-20807-2_24 CrossRefGoogle Scholar
  10. 10.
    Kurpisz, A., Leppänen, S., Mastrolilli, M.: Sum-of-squares hierarchy lower bounds for symmetric formulations. In: Louveaux, Q., Skutella, M. (eds.) IPCO 2016. LNCS, vol. 9682, pp. 362–374. Springer, Cham (2016). doi: 10.1007/978-3-319-33461-5_30 Google Scholar
  11. 11.
    Kurpisz, A., Leppänen, S., Mastrolilli, M.: On the hardest problem formulations for the 0/1 lasserre hierarchy. Math. Oper. Res. 42(1), 135–143 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Kurpisz, A., Leppänen, S., Mastrolilli, M.: An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem. Mathematical Programming (2017, to appear)Google Scholar
  13. 13.
    Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796–817 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Letchford, A.N., Pokutta, S., Schulz, A.S.: On the membership problem for the {0, 1/2}-closure. Oper. Res. Lett. 39(5), 301–304 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2), 293–320 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Pudlák, P.: Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symb. Log. 62(3), 981–998 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Raymond, A., Saunderson, J., Singh, M., Thomas, R.R.: Symmetric sums of squares over \( k \)-subset hypercubes. arXiv preprint arXiv:1606.05639 (2016)
  18. 18.
    Shor, N.: Class of global minimum bounds of polynomial functions. Cybern. Syst. Anal. 23(6), 731–734 (1987)CrossRefzbMATHGoogle Scholar
  19. 19.
    Zuckerberg, M.: A set theoretic approach to lifting procedures for 0, 1 integer programming. Ph.D. thesis, Columbia University (2004)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.IDSIAMannoSwitzerland

Personalised recommendations