{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:51:45Z","timestamp":1743061905067,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030738785"},{"type":"electronic","value":"9783030738792"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73879-2_4","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:04:59Z","timestamp":1620169499000},"page":"43-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sum-of-Squares Hierarchies for Binary Polynomial Optimization"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Slot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monique","family":"Laurent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,5]]},"reference":[{"key":"4_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":"4_CR2","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)"},{"key":"4_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":"4_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":"4_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":"4_CR6","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)"},{"key":"4_CR7","series-title":"Association for Women in Mathematics Series","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-030-21170-7_1","volume-title":"World Women in Mathematics 2018","author":"E Klerk","year":"2019","unstructured":"Klerk, 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.E., Tanbay, B. (eds.) World Women in Mathematics 2018. AWMS, vol. 20, pp. 17\u201356. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21170-7_1"},{"key":"4_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."},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1287\/moor.2018.0983","volume":"45","author":"E de Klerk","year":"2020","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)","journal-title":"Math. Oper. Res."},{"key":"4_CR10","unstructured":"Doherty, A.C., Wehner, S.: Convergence of SDP hierarchies for polynomial optimization on the hypersphere. arXiv:1210.5048v2 (2013)"},{"key":"4_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":"4_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). https:\/\/doi.org\/10.1007\/s10107-015-0977-z","journal-title":"Math. Program."},{"issue":"6","key":"4_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":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-20807-2_24","volume-title":"Integer Programming and Combinatoral Optimization","author":"AR Karlin","year":"2011","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.) IPCO 2011. LNCS, vol. 6655, pp. 301\u2013314. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20807-2_24"},{"key":"4_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":"4_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":"4_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":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-45535-3_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 293\u2013303. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45535-3_23"},{"key":"4_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":"4_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."},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver and Lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28(3), 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"4_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":"4_CR23","doi-asserted-by":"publisher","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry. The IMA Volumes in Mathematics and Its Applications, vol. 149, pp. 157\u2013270. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-09686-5_7","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"4_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01586-y","author":"M Laurent","year":"2020","unstructured":"Laurent, M., Slot, L.: 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","journal-title":"Math. Program."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Lee, J.R., Raghavendra, P., Steurer, D.: Lower bounds on the size of semidefinite programming relaxations. In: STOC 2015: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 567\u2013576 (2015)","DOI":"10.1145\/2746539.2746599"},{"key":"4_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":"4_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."},{"issue":"1","key":"4_CR28","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.jco.2006.07.002","volume":"23","author":"J Nie","year":"2007","unstructured":"Nie, J., Schweighofer, M.: On the complexity of Putinar\u2019s positivstellensatz. J. Complex. 23(1), 135\u2013150 (2007)","journal-title":"J. Complex."},{"key":"4_CR29","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":"4_CR30","unstructured":"Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. thesis, California Institute of Technology (2000)"},{"key":"4_CR31","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)"},{"issue":"1","key":"4_CR32","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02572604","volume":"220","author":"B Reznick","year":"1995","unstructured":"Reznick, B.: Uniform denominators in Hilbert\u2019s seventeenth problem. Mathematische Zeitschrift 220(1), 75\u201397 (1995)","journal-title":"Mathematische Zeitschrift"},{"key":"4_CR33","unstructured":"Rothvoss, T.: The Lasserre hierarchy in approximation algorithms. Lecture Notes for the MAPSP 2013 Tutorial (2013)"},{"issue":"1","key":"4_CR34","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."},{"issue":"4","key":"4_CR35","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.jco.2004.01.005","volume":"20","author":"M Schweighofer","year":"2004","unstructured":"Schweighofer, M.: On the complexity of Schm\u00fcdgen\u2019s positivstellensatz. J. Complex. 20(4), 529\u2013543 (2004)","journal-title":"J. Complex."},{"key":"4_CR36","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. Discrete Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"4_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01468-3","author":"L Slot","year":"2020","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","journal-title":"Math. Program."},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Slot, L., Laurent, M.: Sum-of-squares hierarchies for binary polynomial optimization. arXiv:2011.04027 (2020)","DOI":"10.1007\/978-3-030-73879-2_4"},{"key":"4_CR39","unstructured":"Szeg\u00f6, G.: Orthogonal Polynomials. American Mathematical Society Colloquium Publications, vol. 23. American Mathematical Society (1959)"},{"key":"4_CR40","volume-title":"Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization, Fields Institute Monograph","author":"L Tun\u00e7el","year":"2010","unstructured":"Tun\u00e7el, L.: Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization, Fields Institute Monograph. American Mathematical Society, Providence (2010)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73879-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T10:23:09Z","timestamp":1672050189000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73879-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030738785","9783030738792"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73879-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.gatech.edu\/ipco-2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference took place virtually","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}