{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T19:14:54Z","timestamp":1777490094515,"version":"3.51.4"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,7]],"date-time":"2022-01-07T00:00:00Z","timestamp":1641513600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,7]],"date-time":"2022-01-07T00:00:00Z","timestamp":1641513600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["764759"],"award-info":[{"award-number":["764759"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s10107-021-01745-9","type":"journal-article","created":{"date-parts":[[2022,1,7]],"date-time":"2022-01-07T00:03:47Z","timestamp":1641513827000},"page":"621-660","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Sum-of-squares hierarchies for binary polynomial optimization"],"prefix":"10.1007","volume":"197","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3790-492X","authenticated-orcid":false,"given":"Lucas","family":"Slot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8474-2121","authenticated-orcid":false,"given":"Monique","family":"Laurent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,7]]},"reference":[{"key":"1745_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Naor, A.: Approximating the cut-norm via Grothendieck\u2019s inequality. In: 36th Annual ACM Symposium on Theory of Computing, pp. 72\u201380 (2004)","DOI":"10.1145\/1007352.1007371"},{"key":"1745_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Berger, E., Hazan, E., Kindler, G., Safra, M.: On non-approximability for quadratic programs. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 206\u2013215 (2005)","DOI":"10.1109\/SFCS.2005.57"},{"key":"1745_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"1745_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"46","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 46(1\u20133), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"key":"1745_CR5","unstructured":"Barak, B., Steurer, D.: Sum-of-squares proofs and the quest toward optimal algorithms. In Proceedings of International Congress of Mathematicians (ICM) (2014)"},{"key":"1745_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Wirth, A.: Maximizing quadratic programs: Extending Grothendieck\u2019s inequality. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 54\u201360 (2004)","DOI":"10.1109\/FOCS.2004.39"},{"key":"1745_CR7","doi-asserted-by":"crossref","unstructured":"de\u00a0Klerk, E., Laurent, M.: A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis. In: Araujo C., Benkart G., Praeger C., Tanbay B. (eds), World Women in Mathematics 2018. Association for Women in Mathematics Series, vol. 20, pp. 17\u201356. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-21170-7_1"},{"key":"1745_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01465-1","author":"E de Klerk","year":"2020","unstructured":"de Klerk, E., Laurent, M.: Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-019-01465-1","journal-title":"Math. Program."},{"key":"1745_CR9","doi-asserted-by":"crossref","unstructured":"de Klerk, E., Laurent, M.: Worst-case examples for Lasserre\u2019s measure based hierarchy for polynomial optimization on the hypercube. Math. Oper. Res. 45(1), 86\u201398 (2020)","DOI":"10.1287\/moor.2018.0983"},{"key":"1745_CR10","unstructured":"Doherty, A.C., Wehner, S.: Convergence of SDP hierarchies for polynomial optimization on the hypersphere (2012). arXiv:1210.5048"},{"key":"1745_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01537-7","author":"K Fang","year":"2020","unstructured":"Fang, K., Fawzi, H.: The sum-of-squares hierarchy on the sphere, and applications in quantum information theory. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01537-7","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1745_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10107-015-0977-z","volume":"160","author":"H Fawzi","year":"2016","unstructured":"Fawzi, H., Saunderson, J., Parrilo, P.A.: Sparse sums of squares on finite abelian groups and improved semidefinite lifts. Math. Program. 160(1\u20132), 149\u2013191 (2016)","journal-title":"Math. Program."},{"issue":"6","key":"1745_CR13","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42(6), 1115\u20131145 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"key":"1745_CR14","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Mathieu, C., Nguyen, C.T.: Integrality gaps of linear and semi-definite programming relaxations for knapsack. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) Integer Programming and Combinatoral Optimization, pp. 301\u2013314. Springer, Berlin, Heidelberg (2011)","DOI":"10.1007\/978-3-642-20807-2_24"},{"key":"1745_CR15","unstructured":"Kurpisz, A., Lepp\u00e4nen, S., Mastrolilli, M.: Tight Sum-of-Squares lower bounds for binary polynomial optimization problems. In: Chatzigiannakis, I., et al. (eds) 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) vol. 78, pp. 1\u201314 (2016)"},{"issue":"3","key":"1745_CR16","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"1745_CR17","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.orl.2015.12.014","volume":"44","author":"JB Lasserre","year":"2016","unstructured":"Lasserre, J.B.: A max-cut formulation of $$0\/1$$ programs. Oper. Res. Lett. 44, 158\u2013164 (2016)","journal-title":"Oper. Res. Lett."},{"key":"1745_CR18","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: An explicit exact sdp relaxation for nonlinear 0\u20131 programs. In: Aardal, K., Gerards, B. (eds.) Integer Programming and Combinatorial Optimization, pp. 293\u2013303, Springer, Berlin, Heidelberg (2001)","DOI":"10.1007\/3-540-45535-3_23"},{"key":"1745_CR19","doi-asserted-by":"publisher","DOI":"10.1142\/p665","volume-title":"Moments. Positive Polynomials and Their Applications","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Moments. Positive Polynomials and Their Applications. Imperial College Press, London (2009)"},{"issue":"3","key":"1745_CR20","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/100806990","volume":"21","author":"JB Lasserre","year":"2010","unstructured":"Lasserre, J.B.: A new look at nonnegativity on closed sets and polynomial optimization. SIAM J. Optim. 21(3), 864\u2013885 (2010)","journal-title":"SIAM J. Optim."},{"key":"1745_CR21","doi-asserted-by":"crossref","unstructured":"Laurent, M.: A comparison of the Sherali\u2013Adams, Lov\u00e1sz-Schrijver and Lasserre relaxations for 0-1 programming. Math. Oper. Res., 28(3):470\u2013496 (2003)","DOI":"10.1287\/moor.28.3.470.16391"},{"issue":"4","key":"1745_CR22","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1287\/moor.28.4.871.20508","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: Lower bound for the number of iterations in semidefinite hierarchies for the cut polytope. Math. Oper. Res. 28(4), 871\u2013883 (2003)","journal-title":"Math. Oper. Res."},{"key":"1745_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-004-0561-4","volume":"109","author":"M Laurent","year":"2007","unstructured":"Laurent, M.: Semidefinite representations for finite varieties. Math. Program. 109, 1\u201326 (2007)","journal-title":"Math. Program."},{"key":"1745_CR24","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, Vol. 149 of IMA Volumes in Mathematics and its Applications, pp. 157\u2013270. Springer (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"1745_CR25","doi-asserted-by":"crossref","unstructured":"Lee, J.R., Raghavendra, P., Steurer, D.: Lower bounds on the size of semidefinite programming relaxations. In: STOC \u201915: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 567\u2013576 (2015)","DOI":"10.1145\/2746539.2746599"},{"key":"1745_CR26","unstructured":"Levenshtein, V.I.: Universal bounds for codes and designs. In: Handbook of Coding Theory, vol. 9, pp. 499\u2013648. North-Holland, Amsterdam (1998)"},{"key":"1745_CR27","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"1745_CR28","unstructured":"Macwilliams, F., Sloane, N.: The Theory of Error Correcting Codes, volume 16 of North-Holland Mathematical Library. Elsevier (1983)"},{"key":"1745_CR29","unstructured":"Natanson, I.P.: Constructive Function Theory, Vol. I Uniform Approximation (1964)"},{"key":"1745_CR30","doi-asserted-by":"crossref","unstructured":"Nie, J., Schweighofer, M.: On the complexity of Putinar\u2019s positivstellensatz. J. Complex. 23(1), 135\u2013150 (2007)","DOI":"10.1016\/j.jco.2006.07.002"},{"key":"1745_CR31","unstructured":"O\u2019Donnell, R.: SOS is not obviously automatizable, even approximately. In: 8th Innovations in Theoretical Computer Science Conference vol. 59, pp. 1\u201310 (2017)"},{"key":"1745_CR32","unstructured":"Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D thesis, California Institure of Technology (2000)"},{"key":"1745_CR33","unstructured":"Raghavendra, P., Weitz, B.: On the bit complexity of sum-of-squares proofs. In: 44th International Colloquium on Automata, Languages, and Programming, vol. 80, pp. 1\u201313 (2017)"},{"key":"1745_CR34","doi-asserted-by":"crossref","unstructured":"Reznick, B.: Uniform denominators in Hilbert\u2019s seventeenth problem. Math. Z. 220(1), 75\u201397 (1995)","DOI":"10.1007\/BF02572604"},{"key":"1745_CR35","unstructured":"Rothvoss, T.: The Lasserre hierarchy in approximation algorithms. Lecture Notes for the MAPSP 2013 Tutorial (2013)"},{"issue":"1","key":"1745_CR36","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1137\/16M105544X","volume":"27","author":"S Sakaue","year":"2017","unstructured":"Sakaue, S., Takeda, A., Kim, S., Ito, N.: Exact semidefinite programming relaxations with truncated moment matrix for binary polynomial optimization problems. SIAM J. Optim. 27(1), 565\u2013582 (2017)","journal-title":"SIAM J. Optim."},{"key":"1745_CR37","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-005-0684-2","volume":"107","author":"CW Scherer","year":"2006","unstructured":"Scherer, C.W., Hol, C.W.J.: Matrix sum-of-squares relaxations for robust semi-definite programs. Math. Program. 107, 189\u2013211 (2006)","journal-title":"Math. Program."},{"key":"1745_CR38","doi-asserted-by":"crossref","unstructured":"Schweighofer, M.: On the complexity of Schm\u00fcdgen\u2019s positivstellensatz. J. Complex. 20(4), 529\u2013543 (2004)","DOI":"10.1016\/j.jco.2004.01.005"},{"key":"1745_CR39","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discret. Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discret. Math."},{"key":"1745_CR40","doi-asserted-by":"crossref","unstructured":"Slot, L., Laurent, M.: Improved convergence analysis of Lasserre\u2019s measure-based upper bounds for polynomial minimization on compact sets. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01468-3","DOI":"10.1007\/s10107-020-01468-3"},{"key":"1745_CR41","unstructured":"Szeg\u00f6, G.: Orthogonal Polynomials. vol. 23 in American Mathematical Society colloquium publications. American Mathematical Society (1959)"},{"key":"1745_CR42","doi-asserted-by":"crossref","unstructured":"Slot, L., Laurent, M.: Near-optimal analysis of of Lasserre\u2019s univariate measure-based bounds for multivariate polynomial optimization. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01586-y","DOI":"10.1007\/s10107-020-01586-y"},{"key":"1745_CR43","series-title":"London Mathematical Society Student Texts","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626265","volume-title":"Fourier Analysis on Finite Groups and Applications","author":"A Terras","year":"1999","unstructured":"Terras, A.: Fourier Analysis on Finite Groups and Applications. London Mathematical Society Student Texts, Cambridge University Press, Cambridge (1999)"},{"key":"1745_CR44","doi-asserted-by":"crossref","unstructured":"Tun\u00e7el, L.: Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization. Fields Institute Monograph (2010)","DOI":"10.1090\/fim\/027"},{"key":"1745_CR45","unstructured":"Vallentin, F.: Semidefinite programs and harmonic analysis. arXiv:0809.2017 (2008)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01745-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01745-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01745-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T20:57:32Z","timestamp":1726433852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01745-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,7]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1745"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01745-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,7]]},"assertion":[{"value":"29 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}