{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T23:56:50Z","timestamp":1772668610658,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-21-0107"],"award-info":[{"award-number":["FA9550-21-0107"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-20-2156"],"award-info":[{"award-number":["N00014-20-2156"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N0014-19-1-2322"],"award-info":[{"award-number":["N0014-19-1-2322"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-16-2889"],"award-info":[{"award-number":["N00014-16-2889"]}],"id":[{"id":"10.13039\/100000006","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-022-01818-3","type":"journal-article","created":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T14:23:50Z","timestamp":1652711030000},"page":"661-692","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Complexity, exactness, and rationality in polynomial optimization"],"prefix":"10.1007","volume":"197","author":[{"given":"Daniel","family":"Bienstock","sequence":"first","affiliation":[]},{"given":"Alberto Del","family":"Pia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2730-0084","authenticated-orcid":false,"given":"Robert","family":"Hildebrand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,16]]},"reference":[{"issue":"2","key":"1818_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":"1818_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."},{"key":"1818_CR3","unstructured":"Andronov, V., Belousov, E., Shironin, V.M.: On solvability of the problem of polynomial programming (in russian). Izvestija Akadem. Nauk SSSR, Tekhnicheskaja Kibernetika [Translation appeared in News of the Academy of Science of USSR, Dept. of Technical Sciences, Technical Cybernetics] 4, 194\u2013197 (1982)"},{"key":"1818_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02573959","volume":"10","author":"A Barvinok","year":"1993","unstructured":"Barvinok, A.: Feasibility testing for systems of real quadratic equations. Disc. Comput. Geom. 10, 1\u201313 (1993)","journal-title":"Disc. Comput. Geom."},{"key":"1818_CR5","unstructured":"Basu, S.: Algorithms in real algebraic geometry: a survey (2014)"},{"key":"1818_CR6","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. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/3-540-33099-2"},{"key":"1818_CR7","unstructured":"Belousov, E., Andronov, V.: Solvability and stability of problems of polynomial programming (in russian). Technical report. Moscow University Publ., Moscow (1993)"},{"key":"1818_CR8","unstructured":"Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific (1997)"},{"key":"1818_CR9","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":"1818_CR10","doi-asserted-by":"crossref","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: KNITRO: an integrated package for nonlinear optimization. In: di\u00a0Pillo, G., Roma, M. (eds.) Large-Scale Nonlinear Optimization, pp. 35\u201359. Springer (2006)","DOI":"10.1007\/0-387-30065-1_4"},{"issue":"11","key":"1818_CR11","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. Symbol. Comput. 46(11), 1260\u20131283 (2011). https:\/\/doi.org\/10.1016\/j.jsc.2011.08.007","journal-title":"J. Symbol. Comput."},{"issue":"1\u20132","key":"1818_CR12","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."},{"key":"1818_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Quart. 3, 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Quart."},{"issue":"1","key":"1818_CR14","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":"1818_CR15","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","journal-title":"Ann. Pure Appl. Logic"},{"key":"1818_CR16","doi-asserted-by":"crossref","unstructured":"Heubach, S., Mansour, T.: Combinatorics of Compositions and Words. Discrete Mathematics and Its Applications. CRC Press (2009)","DOI":"10.1201\/9781420072686"},{"issue":"1","key":"1818_CR17","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":"1818_CR18","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":"1818_CR19","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":"1818_CR20","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. Phys. 20(1), 53\u201372 (1980). https:\/\/doi.org\/10.1016\/0041-5553(80)90061-0","journal-title":"USSR Comput. Math. Phys."},{"issue":"2\u20133","key":"1818_CR21","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1080\/02331934.2019.1566327","volume":"68","author":"D Klatte","year":"2019","unstructured":"Klatte, D.: On a Frank\u2013Wolfe type theorem in cubic optimization. Optimization 68(2\u20133), 539\u2013547 (2019)","journal-title":"Optimization"},{"key":"1818_CR22","doi-asserted-by":"crossref","unstructured":"Letchford, A., Parkes, A.J.: A guide to conic optimisation and its applications. RAIRO Oper. Res. 1087\u20131106 (2018)","DOI":"10.1051\/ro\/2018034"},{"key":"1818_CR23","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.\u00a067, pp. 59:1\u201359:10. Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.59","DOI":"10.4230\/LIPIcs.ITCS.2017.59"},{"issue":"1","key":"1818_CR24","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. Glob. Optim. 1(1), 15\u201322 (1991). https:\/\/doi.org\/10.1007\/BF00120662","journal-title":"J. Glob. Optim."},{"key":"1818_CR25","unstructured":"Pataki, G., Touzov, A.: How do exponential size solutions arise in semidefinite programming? (2021)"},{"key":"1818_CR26","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":"1818_CR27","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02614433","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":"1818_CR28","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. Symbol. Comput. 13, 255\u2013299 (1992)","journal-title":"J. Symbol. Comput."},{"key":"1818_CR29","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1137\/0221060","volume":"21","author":"J Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity of approximating solutions for real algebraic formulae. SIAM J. Comput. 21, 1008\u20131025 (1992)","journal-title":"SIAM J. Comput."},{"key":"1818_CR30","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-7091-9459-1_11","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","author":"J Renegar","year":"1998","unstructured":"Renegar, J.: Recent progress on the complexity of the decision problem for the reals. In: Caviness, B.F., Johnson, J.R. (eds.) Quantifier Elimination and Cylindrical Algebraic Decomposition, pp. 220\u2013241. Springer, Vienna (1998)"},{"issue":"5","key":"1818_CR31","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s002000050114","volume":"9","author":"F Rouillier","year":"1999","unstructured":"Rouillier, F.: Solving zero-dimensional systems through the rational univariate representation. Appl. Algebra Eng. Commun. Comput. 9(5), 433\u2013461 (1999). https:\/\/doi.org\/10.1007\/s002000050114","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1818_CR32","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":"1818_CR33","unstructured":"Vavasis, S., Zippel, R.: Proving polynomial-time for sphere-constrained quadratic programming. Technical Report 90-1182. Department of Computer Science, Cornell University (1990)"},{"issue":"2","key":"1818_CR34","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","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"1818_CR35","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"1818_CR36","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":"1818_CR37","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":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01818-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01818-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01818-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T17:20:17Z","timestamp":1675704017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01818-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,16]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1818"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01818-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,16]]},"assertion":[{"value":"2 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}