Advertisement

Mathematical Programming

, Volume 166, Issue 1–2, pp 1–17 | Cite as

An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem

  • Adam Kurpisz
  • Samuli Leppänen
  • Monaldo Mastrolilli
Full Length Paper Series A

Abstract

In this paper we study the complexity of the Min-sum single machine scheduling problem under algorithms from the Sum-of-Squares/Lasserre hierarchy. We prove the first lower bound for this model by showing that the integrality gap is unbounded at level \(\Omega (\sqrt{n})\) even for a variant of the problem that is solvable in \(O(n \log n)\) time by the Moore–Hodgson algorithm, namely Min-number of late jobs. We consider a natural formulation that incorporates the objective function as a constraint and prove the result by partially diagonalizing the matrix associated with the relaxation and exploiting this characterization. To the best of our knowledge, our result provides the first example where the Sum-of-Squares hierarchy exhibits an unbounded integrality gap for a polynomially solvable problem after non-constant number of levels.

Keywords

Sum-of-Squares hierarchy Integrality gap Min-number of late jobs 

Mathematics Subject Classification

90C05 90C22 

Notes

Acknowledgements

The authors would like to express their gratitude to anonymous reviewers for several comments that greatly improved the presentation of this paper.

References

  1. 1.
    Bansal, N., Pruhs, K.: The geometry of scheduling. SIAM J. Comput. 43(5), 1684–1698 (2014)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Barak, B., Chan, S. O., Kothar P. K.: Sum of squares lower bounds from pairwise independence. In: Proceedings of the 47th Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, pp. 97–106 (2015)Google Scholar
  3. 3.
    Bhaskara, A., Charikar, M., Vijayaraghavan, A., Guruswami, V., Zhou, Y.: Polynomial integrality gaps for strong SDP relaxations of densest \(k\)-subgraph. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, pp. 388–405 (2012)Google Scholar
  4. 4.
    Carr, R.D., Fleischer, L., Leung, V. J., Phillips, C. A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, January 9–11, 2000, San Francisco, CA, USA, pp. 106–115 (2000)Google Scholar
  5. 5.
    Cheung, K.K.H.: Computation of the Lasserre ranks of some polytopes. Math. Oper. Res. 32(1), 88–94 (2007)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Cheung, M., Mestre, J., Shmoys, D. B., Verschae, J.: A primal-dual approximation algorithm for min-sum single-machine scheduling problems. In: Proceedings of the 14th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, pp. 135–146 (2011)Google Scholar
  7. 7.
    Chlamtac, E., Tulsiani, M.: Convex relaxations and integrality gaps. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 139–169. Springer, Boston (2012)Google Scholar
  8. 8.
    Fawzi, H., Saunderson, J., Parrilo, P. A.: Sparse sum-of-squares certificates on finite abelian groups. In: 54th IEEE Conference on Decision and Control, CDC 2015, Osaka, Japan, 2015, pp. 5909–5914 (2015)Google Scholar
  9. 9.
    Grigoriev, D.: Complexity of positivstellensatz proofs for the knapsack. Comput. Complex. 10(2), 139–154 (2001)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Grigoriev, D.: Linear lower bound on degrees of positivstellensatz calculus proofs for the parity. Theor. Comput. Sci. 259(1–2), 613–622 (2001)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Karlin, A. R., Mathieu, C., Nguyen, C. T.: Integrality gaps of linear and semi-definite programming relaxations for knapsack. In: Proceedings of the 15th International Conference on Integer Programming and Combinatoral Optimization, IPCO 2011, New York, NY, USA, pp. 301–314 (2011)Google Scholar
  12. 12.
    Karp, R.M.: Reducibility among combinatorial problems. In: Proceedings of a Symposium on the Complexity of Computer Computations, Yorktown Heights, New York, pp. 85–103 (1972)Google Scholar
  13. 13.
    Kurpisz, A., Leppänen, S., Mastrolilli, M.: Tight Sum-of-Squares lower bounds for binary polynomial optimization problems. In: Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy, pp. 78:1–14 (2016)Google Scholar
  14. 14.
    Kurpisz, A., Leppänen, S., Mastrolilli, M.: On the hardest problem formulations for the 0/1 Lasserre hierarchy. In: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, ICALP 2015, Kyoto, Japan, pp. 872–885 (2015)Google Scholar
  15. 15.
    Kurpisz, A., Leppänen, S., Mastrolilli, M.: Sum-of-squares hierarchy lower bounds for symmetric formulations. In: Proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, Liège, Belgium, pp. 362–374 (2016)Google Scholar
  16. 16.
    Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796–817 (2001)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Laurent, M.: A comparison of the Sherali–Adams, Lovász-Schrijver, and Lasserre relaxations for 0–1 programming. Math. Oper. Res. 28(3), 470–496 (2003)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Laurent, M.: Lower bound for the number of iterations in semidefinite hierarchies for the cut polytope. Math. Oper. Res. 28(4), 871–883 (2003)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Meka, R., Potechin, A., Wigderson, A.: Sum-of-squares lower bounds for planted clique. In: Proceedings of the 47th Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, pp. 87–96 (2015)Google Scholar
  20. 20.
    Cheung, M., Shmoys, D. B.: A primal-dual approximation algorithm for min-sum single-machine scheduling problems. arXiv:1612.03339v1 [cs.DS]
  21. 21.
    Moore, M.J.: An \(n\) job, one machine sequencing algorithm for minimizing the number of late jobs. Manag. Sci. 15, 102–109 (1968)CrossRefMATHGoogle Scholar
  22. 22.
    O’Donnell, R., Zhou, Y.: Approximability and proof complexity. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, pp. 1537–1556. SIAM (2013)Google Scholar
  23. 23.
    Parrilo, P.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. thesis, California Institute of Technology (2000)Google Scholar
  24. 24.
    Rothvoß, T.: The Lasserre hierarchy in approximation algorithms. Lecture Notes for the MAPSP 2013 - Tutorial (June 2013)Google Scholar
  25. 25.
    Sakaue, S., Takeda, A., Kim, S., Ito, N.: Exact sdp relaxations with truncated moment matrix for binary polynomial optimization problems. In: Proceedings of the 5th International Conference on Continuous Optimization ICCOPT 2016, Tokyo, Japan (2016)Google Scholar
  26. 26.
    Schoenebeck, G.: Linear level Lasserre lower bounds for certain k-csps. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, Philadelphia, PA, USA, pp. 593–602 (2008)Google Scholar
  27. 27.
    Shor, N.: Class of global minimum bounds of polynomial functions. Cybernetics 23(6), 731–734 (1987)CrossRefMATHGoogle Scholar
  28. 28.
    Tulsiani, M.: CSP gaps and reductions in the Lasserre hierarchy. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, pp. 303–312 (2009)Google Scholar
  29. 29.
    Wolsey, L.A.: Facets for a linear inequality in 0–1 variables. Math. Program. 8, 168–175 (1975)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2017

Authors and Affiliations

  • Adam Kurpisz
    • 1
  • Samuli Leppänen
    • 1
  • Monaldo Mastrolilli
    • 1
  1. 1.Dalle Molle Institute for Artificial Intelligence Research (IDSIA)MannoSwitzerland

Personalised recommendations