{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:57:14Z","timestamp":1763665034994,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T00:00:00Z","timestamp":1669593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11471230"],"award-info":[{"award-number":["11471230"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10479-022-05103-6","type":"journal-article","created":{"date-parts":[[2022,11,28]],"date-time":"2022-11-28T18:08:04Z","timestamp":1669658884000},"page":"33-59","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems"],"prefix":"10.1007","volume":"320","author":[{"given":"La","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danyang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1831-8039","authenticated-orcid":false,"given":"Yaping","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,28]]},"reference":[{"issue":"1","key":"5103_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1014813701864","volume":"22","author":"EG Belousov","year":"2002","unstructured":"Belousov, E. G., & Klatte, D. (2002). A Frank\u2013Wolfe type theorem for convex polynomial programs. Computational Optimization and Applications, 22(1), 37\u201348.","journal-title":"Computational Optimization and Applications"},{"key":"5103_CR2","volume-title":"Robust optimization. Princeton series in applied mathematics","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., Ghaoui, L. E., & Nemirovski, A. (2009). Robust optimization. Princeton series in applied mathematics. Princeton, NJ: Princeton University Press."},{"issue":"4","key":"5103_CR3","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., & Nemirovski, A. (1998). Robust convex optimization. Mathematics of Operations Research, 23(4), 769\u2013805.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"5103_CR4","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., & Nemirovski, A. (2002). Robust optimization-methodology and applications. Mathematical Programming, 92(3), 453\u2013480.","journal-title":"Mathematical Programming"},{"issue":"3","key":"5103_CR5","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D. B., & Caramanis, C. (2011). Theory and applications of robust optimization. SIAM Review, 53(3), 464\u2013501.","journal-title":"SIAM Review"},{"key":"5103_CR6","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.amc.2017.07.076","volume":"315","author":"TD Chuong","year":"2017","unstructured":"Chuong, T. D., & Jeyakumar, V. (2017). Convergence hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications. Applied Mathematics and Computation, 315, 381\u2013399.","journal-title":"Applied Mathematics and Computation"},{"key":"5103_CR7","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10107-003-0425-3","volume":"97","author":"D Goldfarb","year":"2003","unstructured":"Goldfarb, D., & Iyengar, G. (2003). Robust convex quadratically constrained programs. Mathematical Programming, 97, 495\u2013515.","journal-title":"Mathematical Programming"},{"key":"5103_CR8","volume-title":"Genericity in polynomial optimization","author":"HV H\u00e0","year":"2016","unstructured":"H\u00e0, H. V., & Ph\u1ea1m, T. S. (2016). Genericity in polynomial optimization. Singapore: World Scientific."},{"issue":"6","key":"5103_CR9","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.orl.2012.09.006","volume":"40","author":"V Jeyakumar","year":"2012","unstructured":"Jeyakumar, V., & Li, G. (2012). Exact SDP relaxations for class of nonlinear semidefinite programming problems. Operations Research Letters, 40(6), 529\u2013536.","journal-title":"Operations Research Letters"},{"issue":"1","key":"5103_CR10","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1080\/00036811.2013.859251","volume":"94","author":"V Jeyakumar","year":"2015","unstructured":"Jeyakumar, V., & Li, G. (2015). A new class of alternative theorems for SOS-convex inequalities and robust optimization. Applicable Analysis, 94(1), 56\u201374.","journal-title":"Applicable Analysis"},{"issue":"1","key":"5103_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11590-014-0732-z","volume":"9","author":"V Jeyakumar","year":"2013","unstructured":"Jeyakumar, V., Li, G., & Vicente-P\u00e9rez, J. (2013). Robust SOS-convex polynomial programs: Exact SDP relaxations. Optimization Letters, 9(1), 1\u201318.","journal-title":"Optimization Letters"},{"issue":"1","key":"5103_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.orl.2013.11.005","volume":"42","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Ph\u1ea1m, T. S., & Li, G. (2014). Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness. Operations Research Letters, 42(1), 34\u201340.","journal-title":"Operations Research Letters"},{"key":"5103_CR13","first-page":"1","volume":"269","author":"LG Jiao","year":"2019","unstructured":"Jiao, L. G., & Lee, J. H. (2019). Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data. Annals of Operations Research, 269, 1\u201318.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"5103_CR14","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/100814147","volume":"21","author":"ED Klerk","year":"2011","unstructured":"Klerk, E. D., & Laurent, M. (2011). On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems. SIAM Journal on Optimization, 21(3), 824\u2013832.","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"5103_CR15","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J. B. (2001). Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization, 11(3), 796\u2013817.","journal-title":"SIAM Journal on Optimization"},{"key":"5103_CR16","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. (2009). Moments, positive polynomials and their applications. London: Imperial College Press."},{"issue":"4","key":"5103_CR17","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1137\/080728214","volume":"19","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J. B. (2009). Convexity in semialgebraic geometry and polynomial optimization. SIAM Journal on Optimization, 19(4), 1995\u20132014.","journal-title":"SIAM Journal on Optimization"},{"key":"5103_CR18","first-page":"157","volume-title":"Emerging Applications of Algebraic Geometry. IMA volumes in mathematics and its applications","author":"M Laurent","year":"2009","unstructured":"Laurent, M. (2009). Sums of squares, moment matrices and optimization over polynomials. In M. Putinar & S. Sullivant (Eds.), Emerging Applications of Algebraic Geometry. IMA volumes in mathematics and its applications (Vol. 149, pp. 157\u2013270). New York: Springer."},{"issue":"1","key":"5103_CR19","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10479-016-2363-5","volume":"269","author":"JH Lee","year":"2018","unstructured":"Lee, J. H., & Lee, G. M. (2018). On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems. Annals of Operations Research, 269(1), 419\u2013438.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"5103_CR20","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.1137\/16M1068992","volume":"27","author":"GM Lee","year":"2017","unstructured":"Lee, G. M., & Ph\u1ea1m, T. S. (2017). Generic properties for semialgebraic programs. SIAM Journal on Optimization, 27(3), 2061\u20132084.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"5103_CR21","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10107-013-0680-x","volume":"146","author":"JW Nie","year":"2014","unstructured":"Nie, J. W. (2014). Optimality conditions and finite convergence of Lasserre\u2019s hierarchy. Mathematical Programming, 146(1), 97\u2013121.","journal-title":"Mathematical Programming"},{"key":"5103_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04648-7","volume-title":"Positive polynomials. Springer monographs in mathematics","author":"A Prestel","year":"2001","unstructured":"Prestel, A., & Delzell, C. N. (2001). Positive polynomials. Springer monographs in mathematics. Berlin: Springer."},{"issue":"3","key":"5103_CR23","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M. (1993). Positive polynomials on compact semi-algebraic sets. Indiana University Mathematics Journal, 42(3), 969\u2013984.","journal-title":"Indiana University Mathematics Journal"},{"issue":"1","key":"5103_CR24","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01100204","volume":"7","author":"M Ramana","year":"1995","unstructured":"Ramana, M., & Goldman, A. J. (1995). Some geometric results in semidefinite programmming. Journal of Global Optimization, 7(1), 33\u201350.","journal-title":"Journal of Global Optimization"},{"key":"5103_CR25","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R. T. (1970). Convex analysis. Princeton: Princeton University Press."},{"issue":"4","key":"5103_CR26","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s00209-003-0568-1","volume":"245","author":"C Scheiderer","year":"2003","unstructured":"Scheiderer, C. (2003). Sums of squares on real algebraic curves. Mathematische Zeitschrift, 245(4), 725\u2013760.","journal-title":"Mathematische Zeitschrift"},{"issue":"2","key":"5103_CR27","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.jalgebra.2005.01.043","volume":"289","author":"C Scheiderer","year":"2005","unstructured":"Scheiderer, C. (2005). Distinguished representations of non-negative polynomials. Journal of Algebra, 289(2), 558\u2013573.","journal-title":"Journal of Algebra"},{"issue":"1","key":"5103_CR28","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01446568","volume":"289","author":"K Schm\u00fcdgen","year":"1991","unstructured":"Schm\u00fcdgen, K. (1991). The K-moment problem for compact semi-algebraic sets. Mathematische Annalen, 289(1), 203\u2013206.","journal-title":"Mathematische Annalen"},{"issue":"1","key":"5103_CR29","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2140\/pjm.1958.8.171","volume":"8","author":"M Sion","year":"1958","unstructured":"Sion, M. (1958). On general minimax theorems. Pacific Journal of Mathematics, 8(1), 171\u2013176.","journal-title":"Pacific Journal of Mathematics"},{"key":"5103_CR30","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"A Soyster","year":"1973","unstructured":"Soyster, A. (1973). Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research, 21, 1154\u20131157.","journal-title":"Operations Research"},{"issue":"5","key":"5103_CR31","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1090\/noti1116","volume":"61","author":"C Vinzant","year":"2014","unstructured":"Vinzant, C. (2014). What is a spectrahedron? Notices of the American Mathematical Society, 61(5), 492\u2013494.","journal-title":"Notices of the American Mathematical Society"},{"key":"5103_CR32","doi-asserted-by":"publisher","DOI":"10.1142\/5021","volume-title":"Convex analysis in general vector spaces","author":"C Zalinescu","year":"2002","unstructured":"Zalinescu, C. (2002). Convex analysis in general vector spaces. Singapore: World Scientific."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-05103-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-05103-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-05103-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T03:13:48Z","timestamp":1673406828000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-05103-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,28]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["5103"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-05103-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2022,11,28]]},"assertion":[{"value":"22 November 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}