{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T02:21:56Z","timestamp":1771554116263,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T00:00:00Z","timestamp":1704499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T00:00:00Z","timestamp":1704499200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10898-023-01353-1","type":"journal-article","created":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T13:02:16Z","timestamp":1704546136000},"page":"755-776","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4329-9845","authenticated-orcid":false,"given":"Xiangkai","family":"Sun","sequence":"first","affiliation":[]},{"given":"Jiayi","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Kok Lay","family":"Teo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,6]]},"reference":[{"key":"1353_CR1","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: Moments. Positive Polynomials and Their Applications. Imperial College Press, London (2009)","DOI":"10.1142\/p665"},{"key":"1353_CR2","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/100814147","volume":"21","author":"ED Klerk","year":"2011","unstructured":"Klerk, E.D., Laurent, M.: On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems. SIAM J. Optim. 21, 824\u2013832 (2011)","journal-title":"SIAM J. Optim."},{"key":"1353_CR3","doi-asserted-by":"publisher","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, 275\u2013292 (2012)","journal-title":"Math. Program."},{"key":"1353_CR4","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1137\/110856010","volume":"23","author":"AA Ahmadi","year":"2013","unstructured":"Ahmadi, A.A., Parrilo, P.A.: A complete characterization of the gap between convexity and SOS-convexity. SIAM J. Optim. 23, 811\u2013833 (2013)","journal-title":"SIAM J. Optim."},{"key":"1353_CR5","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1137\/13090599X","volume":"25","author":"HV Ngai","year":"2015","unstructured":"Ngai, H.V.: Global error bounds for systems of convex polynomial over polyhedral constraints. SIAM J. Optim. 25, 521\u2013539 (2015)","journal-title":"SIAM J. Optim."},{"key":"1353_CR6","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s11590-015-0894-3","volume":"10","author":"AA Ahmadi","year":"2016","unstructured":"Ahmadi, A.A., Majumdar, A.: Some applications of polynomial optimization in operations research and real-time decision making. Optim. Lett. 10, 709\u2013729 (2016)","journal-title":"Optim. Lett."},{"key":"1353_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.orl.2015.11.011","volume":"44","author":"MA Goberna","year":"2016","unstructured":"Goberna, M.A., Jeyakumar, V., Li, G., Linh, N.: Radius of robust feasibility and optimality of uncertain convex programs. Oper. Res. Lett. 44, 67\u201373 (2016)","journal-title":"Oper. Res. Lett."},{"key":"1353_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.orl.2020.02.003","volume":"48","author":"LG Jiao","year":"2020","unstructured":"Jiao, L.G., Lee, J.H., Zhou, Y.Y.: A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials. Oper. Res. Lett. 48, 188\u2013194 (2020)","journal-title":"Oper. Res. Lett."},{"key":"1353_CR9","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.orl.2021.06.004","volume":"49","author":"XB Li","year":"2021","unstructured":"Li, X.B., Al-Homidan, S., Ansari, Q.H., Yao, J.C.: A sufficient condition for asymptotically well behaved property of convex polynomials. Oper. Res. Lett. 49, 548\u2013552 (2021)","journal-title":"Oper. Res. Lett."},{"key":"1353_CR10","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1137\/080728214","volume":"19","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Convexity in semialgebraic geometry and polynomial optimization. SIAM J. Optim. 19, 1995\u20132014 (2009)","journal-title":"SIAM J. Optim."},{"key":"1353_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10107-008-0240-y","volume":"122","author":"JW Helton","year":"2010","unstructured":"Helton, J.W., Nie, J.: Semidefinite representation of convex sets. Math. Program. 122, 21\u201364 (2010)","journal-title":"Math. Program."},{"key":"1353_CR12","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.: Exact SDP relaxations for classes of nonlinear semidefinite programming problems. Oper. Res. Lett. 40, 529\u2013536 (2012)","journal-title":"Oper. Res. Lett."},{"key":"1353_CR13","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s10957-013-0496-0","volume":"162","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Vicente-P\u00e9rez, J.: Dual semidefinite programs without duality gaps for a class of convex minimax programs. J. Optim. Theory Appl. 162, 735\u2013753 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"1353_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-017-1210-z","volume":"169","author":"JH Lee","year":"2017","unstructured":"Lee, J.H., Lee, G.M.: On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint. Math. Program. 169, 177\u2013198 (2017)","journal-title":"Math. Program."},{"key":"1353_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/18M118935X","volume":"3","author":"AA Ahmadi","year":"2019","unstructured":"Ahmadi, A.A., Majumdar, A.: DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization. SIAM J. Appl. Algebra Geom. 3, 193\u2013230 (2019)","journal-title":"SIAM J. Appl. Algebra Geom."},{"key":"1353_CR16","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10957-014-0564-0","volume":"164","author":"V Jeyakumar","year":"2015","unstructured":"Jeyakumar, V., Lee, G.M., Li, G.: Characterizing robust solution sets of convex programs under data uncertainty. J. Optim. Theory Appl. 164, 407\u2013435 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"1353_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11590-014-0732-z","volume":"9","author":"V Jeyakumar","year":"2015","unstructured":"Jeyakumar, V., Li, G., Vicente-P\u00e9rez, J.: Robust SOS-convex polynomial optimization problems: exact SDP relaxations. Optim. Lett. 9, 1\u201318 (2015)","journal-title":"Optim. Lett."},{"key":"1353_CR18","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1137\/17M1143484","volume":"28","author":"TD Chuong","year":"2018","unstructured":"Chuong, T.D.: Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs. SIAM J. Optim. 28, 2466\u20132488 (2018)","journal-title":"SIAM J. Optim."},{"key":"1353_CR19","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s10479-019-03216-z","volume":"296","author":"JH Lee","year":"2021","unstructured":"Lee, J.H., Jiao, L.G.: Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data. Ann. Oper. Res. 296, 803\u2013820 (2021)","journal-title":"Ann. Oper. Res."},{"key":"1353_CR20","doi-asserted-by":"publisher","first-page":"1896","DOI":"10.1080\/01630563.2021.2001827","volume":"42","author":"M Wang","year":"2021","unstructured":"Wang, M., Li, X.B., Chen, J.W., Al-Homidan, S.: On radius of robust feasibility for convex conic programs with data uncertainty. Numer. Funct. Anal. Optim. 42, 1896\u20131924 (2021)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"1353_CR21","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s10898-019-00831-9","volume":"75","author":"TD Chuong","year":"2019","unstructured":"Chuong, T.D., Jeyakumar, V., Li, G.: A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs. J. Glob. Optim. 75, 885\u2013919 (2019)","journal-title":"J. Glob. Optim."},{"key":"1353_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"MS Lobo","year":"1998","unstructured":"Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284, 193\u2013228 (1998)","journal-title":"Linear Algebra Appl."},{"key":"1353_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95, 3\u201351 (2003)","journal-title":"Math. Program."},{"key":"1353_CR24","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/s10479-020-03577-w","volume":"311","author":"TD Chuong","year":"2022","unstructured":"Chuong, T.D.: Second-order cone programming relaxations for a class of multiobjective convex polynomial problems. Ann. Oper. Res. 311, 1017\u20131033 (2022)","journal-title":"Ann. Oper. Res."},{"key":"1353_CR25","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01100204","volume":"7","author":"M Ramana","year":"1995","unstructured":"Ramana, M., Goldman, A.J.: Some geometric results in semidefinite programming. J. Glob. Optim. 7, 33\u201350 (1995)","journal-title":"J. Glob. Optim."},{"key":"1353_CR26","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1090\/noti1116","volume":"61","author":"C Vinzant","year":"2014","unstructured":"Vinzant, C.: What is a spectrahedron? Notices Am. Math. Soc. 61, 492\u2013494 (2014)","journal-title":"Notices Am. Math. Soc."},{"key":"1353_CR27","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"1353_CR28","first-page":"305","volume":"40","author":"D Kuroiwa","year":"2012","unstructured":"Kuroiwa, D., Lee, G.M.: On robust multiobjective optimization. Vietnam J. Math. 40, 305\u2013317 (2012)","journal-title":"Vietnam J. Math."},{"key":"1353_CR29","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2005)"},{"key":"1353_CR30","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms, and engineering applications. SIAM Philadelphia (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"1353_CR31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972290","volume-title":"Semidefinite Optimization and Convex Algebraic Geometry","author":"G Blekherman","year":"2012","unstructured":"Blekherman, G., Parrilo, P.A., Thomas, R.: Semidefinite Optimization and Convex Algebraic Geometry. SIAM, Philadelphia (2012)"},{"key":"1353_CR32","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, Version 2.1. (2014)"},{"key":"1353_CR33","doi-asserted-by":"publisher","first-page":"803","DOI":"10.3934\/jimo.2016047","volume":"13","author":"XK Sun","year":"2017","unstructured":"Sun, X.K., Long, X.J., Fu, H.Y., Li, X.B.: Some characterizations of robust optimal solutions for uncertain fractional optimization and applications. J. Ind. Manag. Optim. 13, 803\u2013824 (2017)","journal-title":"J. Ind. Manag. Optim."},{"key":"1353_CR34","doi-asserted-by":"publisher","first-page":"469","DOI":"10.3934\/jimo.2018163","volume":"16","author":"N Sisarat","year":"2020","unstructured":"Sisarat, N., Wangkeeree, R., Lee, G.M.: Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints. J. Ind. Manag. Optim. 16, 469\u2013493 (2020)","journal-title":"J. Ind. Manag. Optim."},{"key":"1353_CR35","doi-asserted-by":"publisher","first-page":"2651","DOI":"10.3934\/jimo.2019074","volume":"16","author":"J Kerdkaew","year":"2020","unstructured":"Kerdkaew, J., Wangkeeree, R.: Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty. J. Ind. Manag. Optim. 16, 2651\u20132673 (2020)","journal-title":"J. Ind. Manag. Optim."},{"key":"1353_CR36","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10898-022-01134-2","volume":"87","author":"J Liu","year":"2023","unstructured":"Liu, J., Long, X.J., Sun, X.K.: Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferential. J. Glob. Optim. 87, 481\u2013501 (2023)","journal-title":"J. Glob. Optim."},{"key":"1353_CR37","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10957-018-1437-8","volume":"181","author":"JW Chen","year":"2019","unstructured":"Chen, J.W., K\u00f6bis, E., Yao, J.C.: Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints. J. Optim. Theory Appl. 181, 411\u2013436 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"1353_CR38","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.3934\/jimo.2018089","volume":"15","author":"XB Li","year":"2019","unstructured":"Li, X.B., Wang, Q.L., Lin, Z.: Optimality conditions and duality for minimax fractional programming problems with data uncertainty. J. Ind. Manag. Optim. 15, 1133\u20131151 (2019)","journal-title":"J. Ind. Manag. Optim."},{"key":"1353_CR39","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10957-021-01938-4","volume":"191","author":"XK Sun","year":"2021","unstructured":"Sun, X.K., Teo, K.L., Long, X.J.: Some characterizations of approximate solutions for robust semi-infinite optimization problems. J. Optim. Theory Appl. 191, 281\u2013310 (2021)","journal-title":"J. Optim. Theory Appl."},{"key":"1353_CR40","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1080\/02331934.2020.1728268","volume":"70","author":"J Wang","year":"2021","unstructured":"Wang, J., Li, S.J., Chen, C.R.: Generalized robust duality in constrained nonconvex optimization. Optimization 70, 591\u2013612 (2021)","journal-title":"Optimization"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01353-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01353-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01353-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T15:07:51Z","timestamp":1730992071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01353-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,6]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1353"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01353-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,6]]},"assertion":[{"value":"22 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}