{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:59:41Z","timestamp":1743076781507,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"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_5","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:04:59Z","timestamp":1620169499000},"page":"58-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complexity, Exactness, and Rationality in Polynomial Optimization"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Bienstock","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Del Pia","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Hildebrand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,5]]},"reference":[{"issue":"2","key":"5_CR1","first-page":"15","volume":"19","author":"T Albu","year":"2011","unstructured":"Albu, T.: The irrationality of sums of radicals via Cogalois theory. Analele stiintifice ale Universitatii Ovidius Constanta 19(2), 15\u201336 (2011)","journal-title":"Analele stiintifice ale Universitatii Ovidius Constanta"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5, 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02573959","volume":"10","author":"AI Barvinok","year":"1993","unstructured":"Barvinok, A.I.: Feasibility testing for systems of real quadratic equations. Discrete Comput. Geom. 10(1), 1\u201313 (1993). https:\/\/doi.org\/10.1007\/BF02573959","journal-title":"Discrete Comput. Geom."},{"key":"5_CR4","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"S Basu","year":"2006","unstructured":"Basu, S., Pollack, R., Roy, M.F.: Algorithms in Real Algebraic Geometry. AACIM, vol. 10. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-33099-2"},{"key":"5_CR5","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1137\/15M1009871","volume":"26","author":"D Bienstock","year":"2016","unstructured":"Bienstock, D.: A note on polynomial solvability of the CDT problem. SIAM J. Optim. 26, 486\u2013496 (2016)","journal-title":"SIAM J. Optim."},{"key":"5_CR7","unstructured":"Bienstock, D., Del Pia, A., Hildebrand, R.: Complexity, exactness, and rationality in polynomial optimization. Optimization (2020). http:\/\/www.optimization-online.org\/DB_HTML\/2020\/11\/8105.html. 2020\/11\/8105"},{"issue":"11","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1016\/j.jsc.2011.08.007","volume":"46","author":"JA De Loera","year":"2011","unstructured":"De Loera, J.A., Lee, J., Malkin, P.N., Margulies, S.: Computing infeasibility certificates for combinatorial problems through Hilbert\u2019s Nullstellensatz. J. Symbolic Comput. 46(11), 1260\u20131283 (2011). https:\/\/doi.org\/10.1016\/j.jsc.2011.08.007. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0747717111001192","journal-title":"J. Symbolic Comput."},{"issue":"1\u20132","key":"5_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-016-1036-0","volume":"162","author":"A Del Pia","year":"2016","unstructured":"Del Pia, A., Dey, S.S., Molinaro, M.: Mixed-integer quadratic programming is in NP. Math. Program. 162(1\u20132), 225\u2013240 (2016). https:\/\/doi.org\/10.1007\/s10107-016-1036-0","journal-title":"Math. Program."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1137\/110857751","volume":"23","author":"G Geronimo","year":"2013","unstructured":"Geronimo, G., Perrucci, D., Tsigaridas, E.: On the minimum of a polynomial function on a basic closed semialgebraic set and applications. SIAM J. Optim. 23(1), 241\u2013255 (2013). https:\/\/doi.org\/10.1137\/110857751","journal-title":"SIAM J. Optim."},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0168-0072(01)00055-0","volume":"113","author":"D Grigoriev","year":"2001","unstructured":"Grigoriev, D., Vorobjov, N.: Complexity of Null- and Positivstellensatz proofs. Ann. Pure Appl. Logic 113(1), 153\u2013160 (2001). https:\/\/doi.org\/10.1016\/S0168-0072(01)00055-0. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0168007201000550. First St. Petersburg Conference on Days of Logic and Computability","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10479-007-0172-6","volume":"153","author":"DS Hochbaum","year":"2007","unstructured":"Hochbaum, D.S.: Complexity and algorithms for nonlinear optimization problems. Ann. Oper. Res. 153(1), 257\u2013296 (2007). https:\/\/doi.org\/10.1007\/s10479-007-0172-6","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/bf02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984). https:\/\/doi.org\/10.1007\/bf02579150","journal-title":"Combinatorica"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: An interior-point approach to NP-complete problems (1989). manuscript","DOI":"10.1090\/conm\/114\/1097880"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0041-5553(80)90061-0","volume":"20","author":"L Khachiyan","year":"1980","unstructured":"Khachiyan, L.: Polynomial algorithms in linear programming. USSR Comput. Math. Math. Phys. 20(1), 53\u201372 (1980). https:\/\/doi.org\/10.1016\/0041-5553(80)90061-0. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0041555380900610","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1051\/ro\/2018034","volume":"52","author":"A Letchford","year":"2018","unstructured":"Letchford, A., Parkes, A.J.: A guide to conic optimisation and its applications. RAIRO-Oper. Res. 52, 1087\u20131106 (2018)","journal-title":"RAIRO-Oper. Res."},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"O\u2019Donnell, R.: SOS is not obviously automatizable, even approximately. In: Papadimitriou, C.H. (ed.) 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 67, pp. 59:1\u201359:10. Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.59, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/8198","DOI":"10.4230\/LIPIcs.ITCS.2017.59"},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Global Optim. 1(1), 15\u201322 (1991). https:\/\/doi.org\/10.1007\/BF00120662","journal-title":"J. Global Optim."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1137\/S003614450444614X","volume":"49","author":"S P\u00f3lik","year":"2007","unstructured":"P\u00f3lik, S., Terlaky, T.: A survey of the S-lemma. SIAM Rev. 49, 371\u2013418 (2007)","journal-title":"SIAM Rev."},{"key":"5_CR20","first-page":"129","volume":"77","author":"M Ramana","year":"1997","unstructured":"Ramana, M.: An exact duality theory for semidefinite programming and its complexity implications. Math. Program. 77, 129\u2013162 (1997)","journal-title":"Math. Program."},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. Part I: introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals. J. Symbolic Comput. 13, 255\u2013299 (1992)","journal-title":"J. Symbolic Comput."},{"key":"5_CR22","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"key":"5_CR23","unstructured":"Vavasis, S., Zippel, R.: Proving polynomial-time for sphere-constrained quadratic programming. Technical report 90\u20131182, Department of Computer Science, Cornell University (1990)"},{"issue":"2","key":"5_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(90)90100-C","volume":"36","author":"SA Vavasis","year":"1990","unstructured":"Vavasis, S.A.: Quadratic programming is in NP. Inf. Process. Lett. 36(2), 73\u201377 (1990). https:\/\/doi.org\/10.1016\/0020-0190(90)90100-C. http:\/\/www.sciencedirect.com\/science\/article\/pii\/002001909090100C","journal-title":"Inf. Process. Lett."},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/s10589-011-9437-8","volume":"53","author":"H Waki","year":"2012","unstructured":"Waki, H., Nakata, M., Muramatsu, M.: Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization. Comput. Optim. Appl. 53, 823\u2013844 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"5_CR26","first-page":"19","volume-title":"Recent Advances in Global Optimization","author":"Y Ye","year":"1992","unstructured":"Ye, Y.: A new complexity result on minimization of a quadratic function with a sphere constraint. In: Floudas, A., Pardalos, P. (eds.) Recent Advances in Global Optimization, pp. 19\u201331. Princeton University Press, Princeton (1992)"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:06:14Z","timestamp":1620169574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73879-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030738785","9783030738792"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73879-2_5","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)"}}]}}