{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:38:18Z","timestamp":1759847898048,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T00:00:00Z","timestamp":1579564800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T00:00:00Z","timestamp":1579564800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11401074","11801064","11571350"],"award-info":[{"award-number":["11401074","11801064","11571350"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Foundation of Liaoning Education Committee","award":["LN2017QN043"],"award-info":[{"award-number":["LN2017QN043"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10589-020-00168-0","type":"journal-article","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T03:02:46Z","timestamp":1579575766000},"page":"669-699","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems"],"prefix":"10.1007","volume":"75","author":[{"given":"Feng","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoxia","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,21]]},"reference":[{"issue":"2","key":"168_CR1","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1137\/110856010","volume":"23","author":"A Ahmadi","year":"2013","unstructured":"Ahmadi, A., Parrilo, P.: A complete characterization of the gap between convexity and SOS-convexity. SIAM J. Optim. 23(2), 811\u2013833 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"168_CR2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s10107-011-0499-2","volume":"137","author":"AA Ahmadi","year":"2013","unstructured":"Ahmadi, A.A., Olshevsky, A., Parrilo, P.A., Tsitsiklis, J.N.: NP-hardness of deciding convexity of quartic polynomials and related problems. Math. Program. 137(1), 453\u2013476 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"168_CR3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10107-011-0457-z","volume":"135","author":"AA Ahmadi","year":"2012","unstructured":"Ahmadi, A.A., Parrilo, P.A.: A convex polynomial that is not SOS-convex. Math. Program. 135(1), 275\u2013292 (2012)","journal-title":"Math. Program."},{"key":"168_CR4","volume-title":"Introduction to Convex Analysis and Integer Programming","author":"E Belousov","year":"1977","unstructured":"Belousov, E.: Introduction to Convex Analysis and Integer Programming. Moscow University Publ, Moscow (1977)"},{"key":"168_CR5","series-title":"MPS-SIAM Series on Optimization","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2001)"},{"key":"168_CR6","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1215\/ijm\/1256046160","volume":"28","author":"C Berg","year":"1984","unstructured":"Berg, C., Maserick, P.H.: Exponentially bounded positive definite functions. Ill. J. Math. 28, 162\u2013179 (1984)","journal-title":"Ill. J. Math."},{"key":"168_CR7","volume-title":"Convex Optimization Theory","author":"DP Bertsekas","year":"2009","unstructured":"Bertsekas, D.P.: Convex Optimization Theory. Athena Scientific, Belmont (2009)"},{"key":"168_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03718-8","volume-title":"Real Algebraic Geometry","author":"J Bochnak","year":"1998","unstructured":"Bochnak, J., Coste, M., Roy, M.-F.: Real Algebraic Geometry. Springer, Berlin (1998)"},{"issue":"1","key":"168_CR9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01584251","volume":"21","author":"JM Borwein","year":"1981","unstructured":"Borwein, J.M.: Direct theorems in semi-infinite convex programming. Math. Program. 21(1), 301\u2013318 (1981)","journal-title":"Math. Program."},{"issue":"1","key":"168_CR10","first-page":"189","volume":"54","author":"RE Curto","year":"2005","unstructured":"Curto, R.E., Fialkow, L.A.: Truncated $$K$$-moment problems in several variables. J. Oper. Theory 54(1), 189\u2013226 (2005)","journal-title":"J. Oper. Theory"},{"key":"168_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1142-6","volume-title":"Linear Optimization and Approximation","author":"K Glashoff","year":"1983","unstructured":"Glashoff, K., Gustafson, S.A.: Linear Optimization and Approximation. Springer, Berlin (1983)"},{"issue":"3","key":"168_CR12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-017-0350-6","volume":"15","author":"MA Goberna","year":"2017","unstructured":"Goberna, M.A., L\u00f3pez, M.A.: Recent contributions to linear semi-infinite optimization. 4OR 15(3), 221\u2013264 (2017)","journal-title":"4OR"},{"issue":"4","key":"168_CR13","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1137\/090746525","volume":"20","author":"J Gouveia","year":"2010","unstructured":"Gouveia, J., Parrilo, P., Thomas, R.: Theta bodies for polynomial ideals. SIAM J. Optim. 20(4), 2097\u20132118 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"168_CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1137\/140952247","volume":"25","author":"F Guo","year":"2015","unstructured":"Guo, F., Wang, C., Zhi, L.: Semidefinite representations of noncompact convex sets. SIAM J. Optim. 25(1), 377\u2013395 (2015)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"168_CR15","doi-asserted-by":"crossref","first-page":"562","DOI":"10.2307\/2371187","volume":"57","author":"EK Haviland","year":"1935","unstructured":"Haviland, E.K.: On the momentum problem for distribution functions in more than one dimension. Am. J. Math. 57(3), 562\u2013568 (1935)","journal-title":"Am. J. Math."},{"issue":"2","key":"168_CR16","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/07070526X","volume":"20","author":"J Helton","year":"2009","unstructured":"Helton, J., Nie, J.: Sufficient and necessary conditions for semidefinite representability of convex hulls and sets. SIAM J. Optim. 20(2), 759\u2013791 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"168_CR17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-008-0240-y","volume":"122","author":"J Helton","year":"2010","unstructured":"Helton, J., Nie, J.: Semidefinite representation of convex sets. Math. Program. 122(1), 21\u201364 (2010)","journal-title":"Math. Program."},{"issue":"3","key":"168_CR18","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R Hettich","year":"1993","unstructured":"Hettich, R., Kortanek, K.O.: Semi-infinite programming: theory, methods, and applications. SIAM Rev. 35(3), 380\u2013429 (1993)","journal-title":"SIAM Rev."},{"issue":"2","key":"168_CR19","doi-asserted-by":"crossref","first-page":"1796","DOI":"10.1137\/17M1128290","volume":"28","author":"T Kriel","year":"2018","unstructured":"Kriel, T., Schweighofer, M.: On the exactness of Lasserre relaxations for compact convex basic closed semialgebraic sets. SIAM J. Optim. 28(2), 1796\u20131816 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"168_CR20","doi-asserted-by":"crossref","first-page":"1995","DOI":"10.1137\/080728214","volume":"19","author":"J Lasserre","year":"2009","unstructured":"Lasserre, J.: Convexity in semialgebraic geometry and polynomial optimization. SIAM J. Optim. 19(4), 1995\u20132014 (2009a)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"168_CR21","doi-asserted-by":"crossref","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."},{"issue":"1","key":"168_CR22","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10107-006-0085-1","volume":"112","author":"JB Lasserre","year":"2008","unstructured":"Lasserre, J.B.: A semidefinite programming approach to the generalized problem of moments. Math. Program. 112(1), 65\u201392 (2008)","journal-title":"Math. Program."},{"issue":"2","key":"168_CR23","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10107-008-0222-0","volume":"120","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Convex sets with semidefinite representation. Math. Program. Ser. A 120(2), 457\u2013477 (2009b)","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"168_CR24","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s11750-011-0172-1","volume":"20","author":"JB Lasserre","year":"2012","unstructured":"Lasserre, J.B.: An algorithm for semi-infinite polynomial optimization. TOP 20(1), 119\u2013129 (2012)","journal-title":"TOP"},{"issue":"2","key":"168_CR25","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/s10107-014-0838-1","volume":"151","author":"JB Lasserre","year":"2015","unstructured":"Lasserre, J.B.: Tractable approximations of sets defined with quantifiers. Math. Program. 151(2), 507\u2013527 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"168_CR26","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s00209-006-0061-8","volume":"256","author":"JB Lasserre","year":"2007","unstructured":"Lasserre, J.B., Netzer, T.: Sos approximations of nonnegative polynomials via simple high degree perturbations. Mathematische Zeitschrift 256(1), 99\u2013112 (2007)","journal-title":"Mathematische Zeitschrift"},{"key":"168_CR27","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-0-387-09686-5_7","volume-title":"Emerging Applications of Algebraic Geometry","author":"M Laurent","year":"2009","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Putinar, M., Sullivant, S. (eds.) Emerging Applications of Algebraic Geometry, pp. 157\u2013270. Springer, New York (2009)"},{"issue":"2","key":"168_CR28","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1070\/SM1969v008n02ABEH001118","volume":"8","author":"V\u00a0L Levin","year":"1969","unstructured":"Levin, V\u00a0.L.: Application of E. Helly\u2019s theorem to convex programming, problems of best approximation and related questions. Math. USSR-Sbornik 8(2), 235 (1969)","journal-title":"Math. USSR-Sbornik"},{"key":"168_CR29","unstructured":"L\u00f6fberg, J.: YALMIP: a toolbox for modeling and optimization in MATLAB. In: 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508), pp. 284\u2013289 (2004)"},{"issue":"2","key":"168_CR30","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/j.ejor.2006.08.045","volume":"180","author":"M L\u00f3pez","year":"2007","unstructured":"L\u00f3pez, M., Still, G.: Semi-infinite programming. Eur. J. Oper. Res. 180(2), 491\u2013518 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"168_CR31","doi-asserted-by":"crossref","first-page":"2143","DOI":"10.1137\/140992047","volume":"25","author":"V Magron","year":"2015","unstructured":"Magron, V., Henrion, D., Lasserre, J.: Semidefinite approximations of projections and polynomial images of semialgebraic sets. SIAM J. Optim. 25(4), 2143\u20132164 (2015)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"168_CR32","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.jsc.2011.08.023","volume":"47","author":"J Nie","year":"2012","unstructured":"Nie, J.: Discriminants and nonnegative polynomials. J. Symbol. Comput. 47(2), 167\u2013191 (2012)","journal-title":"J. Symbol. Comput."},{"issue":"1\u20132","key":"168_CR33","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-011-0489-4","volume":"137","author":"J Nie","year":"2013","unstructured":"Nie, J.: An exact Jacobian SDP relaxation for polynomial optimization. Math. Program. Ser. A 137(1\u20132), 225\u2013255 (2013)","journal-title":"Math. Program. Ser. A"},{"issue":"1\u20132","key":"168_CR34","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10107-013-0680-x","volume":"146","author":"J Nie","year":"2014","unstructured":"Nie, J.: Optimality conditions and finite convergence of lasserre\u2019s hierarchy. Math. Program. Ser. A 146(1\u20132), 97\u2013121 (2014)","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"168_CR35","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/080716670","volume":"20","author":"J Nie","year":"2009","unstructured":"Nie, J., Ranestad, K.: Algebraic degree of polynomial optimization. SIAM J. Optim. 20(1), 485\u2013502 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"168_CR36","doi-asserted-by":"crossref","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."},{"issue":"1","key":"168_CR37","doi-asserted-by":"crossref","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)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"168_CR38","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s10957-008-9473-4","volume":"141","author":"P Parpas","year":"2009","unstructured":"Parpas, P., Rustem, B.: An algorithm for the global optimization of a class of continuous minimax problems. J. Optim. Theory Appl. 141(2), 461\u2013473 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"168_CR39","doi-asserted-by":"crossref","unstructured":"Parrilo, P.A., Sturmfels, B.: Minimizing polynomial functions. In: Algorithmic and quantitative real algebraic geometry. Vol.\u00a060 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, pp. 83\u201399 (2003)","DOI":"10.1090\/dimacs\/060\/08"},{"issue":"10","key":"168_CR40","doi-asserted-by":"crossref","first-page":"4677","DOI":"10.1090\/S0002-9947-00-02595-2","volume":"352","author":"V Powers","year":"2000","unstructured":"Powers, V., Reznick, B.: Polynomials that are positive on an interval. Trans Am. Math. Soc. 352(10), 4677\u20134692 (2000)","journal-title":"Trans Am. Math. Soc."},{"issue":"3","key":"168_CR41","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42(3), 969\u2013984 (1993)","journal-title":"Indiana Univ. Math. J."},{"key":"168_CR42","doi-asserted-by":"crossref","unstructured":"Reznick, B.: Some concrete aspects of Hilbert\u2019s 17th problem. In: Contemporary Mathematics. Vol. 253. American Mathematical Society, pp. 251\u2013272 (2000)","DOI":"10.1090\/conm\/253\/03936"},{"key":"168_CR43","unstructured":"Rostalski, P.: Bermeja\u2014software for convex algebraic geometry (2010). http:\/\/math.berkeley.edu\/~philipp\/cagwiki"},{"issue":"1","key":"168_CR44","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/17M1118981","volume":"2","author":"C Scheiderer","year":"2018","unstructured":"Scheiderer, C.: Spectrahedral shadows. SIAM J. Appl. Algebra Geom. 2(1), 26\u201344 (2018)","journal-title":"SIAM J. Appl. Algebra Geom."},{"issue":"1","key":"168_CR45","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01446568","volume":"289","author":"K Schm\u00fcdgen","year":"1991","unstructured":"Schm\u00fcdgen, K.: The K-moment problem for compact semi-algebraic sets. Math. Ann. 289(1), 203\u2013206 (1991)","journal-title":"Math. Ann."},{"issue":"1","key":"168_CR46","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10589-013-9612-1","volume":"58","author":"L Wang","year":"2013","unstructured":"Wang, L., Guo, F.: Semidefinite relaxations for semi-infinite polynomial programming. Comput. Optim. Appl. 58(1), 133\u2013159 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"168_CR47","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of Semidefinite Programming\u2014Theory, Algorithms, and Applications","author":"H Wolkowicz","year":"2000","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of Semidefinite Programming\u2014Theory, Algorithms, and Applications. Kluwer Academic Publisher, Dordrecht (2000)"},{"issue":"3","key":"168_CR48","first-page":"603","volume":"64","author":"Y Xu","year":"2015","unstructured":"Xu, Y., Sun, W., Qi, L.: On solving a class of linear semi-infinite programming by SDP method. Optimization 64(3), 603\u2013616 (2015)","journal-title":"Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00168-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-020-00168-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00168-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T00:22:51Z","timestamp":1611102171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-020-00168-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,21]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["168"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00168-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2020,1,21]]},"assertion":[{"value":"29 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}