{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T17:10:04Z","timestamp":1776705004040,"version":"3.51.2"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T00:00:00Z","timestamp":1695254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T00:00:00Z","timestamp":1695254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100007847","name":"Natural Science Foundation of Jilin Province","doi-asserted-by":"publisher","award":["YDZJ202201ZYTS302"],"award-info":[{"award-number":["YDZJ202201ZYTS302"]}],"id":[{"id":"10.13039\/100007847","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2021R1C1C2004488"],"award-info":[{"award-number":["NRF-2021R1C1C2004488"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013076","name":"National Major Science and Technology Projects of China","doi-asserted-by":"publisher","award":["NSFC12292980"],"award-info":[{"award-number":["NSFC12292980"]}],"id":[{"id":"10.13039\/501100013076","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013076","name":"National Major Science and Technology Projects of China","doi-asserted-by":"publisher","award":["NSFC12292984"],"award-info":[{"award-number":["NSFC12292984"]}],"id":[{"id":"10.13039\/501100013076","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Project of Beijing Natural Science Foundation","award":["BMNSF-Z210003"],"award-info":[{"award-number":["BMNSF-Z210003"]}]},{"name":"Key Project of National Natural Science Foundation of China","award":["NSFC12031016"],"award-info":[{"award-number":["NSFC12031016"]}]},{"name":"Key Project of National Natural Science Foundation of China","award":["NSFC12026607"],"award-info":[{"award-number":["NSFC12026607"]}]},{"name":"Major project of National Natural Science Foundation of China","award":["NSFC12292980"],"award-info":[{"award-number":["NSFC12292980"]}]},{"name":"Major project of National Natural Science Foundation of China","award":["NSFC12292984"],"award-info":[{"award-number":["NSFC12292984"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10898-023-01321-9","type":"journal-article","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T04:02:01Z","timestamp":1695268921000},"page":"461-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A utopia point method-based robust vector polynomial optimization scheme"],"prefix":"10.1007","volume":"88","author":[{"given":"Tianyi","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liguo","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jae Hyoung","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junping","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"key":"1321_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2008.09.010","volume":"37","author":"A Beck","year":"2009","unstructured":"Beck, A., Ben-Tal, A.: Duality in robust optimization: primal worst equals dual best. Oper. Res. Lett. 37, 1\u20136 (2009)","journal-title":"Oper. Res. Lett."},{"key":"1321_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., Ghaoui, L.E., Nemirovskii, A.: Robust Optimization. Princeton University Press, Princeton, NJ (2009)"},{"key":"1321_CR3","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.: Robust optimization\u2013methodology and applications. Math. Program. 92, 453\u2013480 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"1321_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-006-0092-2","volume":"112","author":"A Ben-Tal","year":"2008","unstructured":"Ben-Tal, A., Nemirovski, A.: Selected topics in robust convex optimization. Math. Program. 112(1), 125\u2013158 (2008)","journal-title":"Math. Program."},{"key":"1321_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.: Theory and applications of robust optimization. SIAM Rev. 53, 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"key":"1321_CR6","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1287\/mnsc.26.7.694","volume":"26","author":"GR Bitran","year":"1980","unstructured":"Bitran, G.R.: Linear multiple objective problems with interval coefficients. Manage. Sci. 26, 694\u2013706 (1980)","journal-title":"Manage. Sci."},{"key":"1321_CR7","volume-title":"Multiobjective Decision Making: Theory and Methodology","author":"V Chankong","year":"1983","unstructured":"Chankong, V., Haimes, Y.Y.: Multiobjective Decision Making: Theory and Methodology. North-Holland, Amsterdam (1983)"},{"issue":"3","key":"1321_CR8","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(3), 2466\u20132488 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1321_CR9","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(2), 1017\u20131033 (2022)","journal-title":"Ann. Oper. Res."},{"key":"1321_CR10","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Berlin (2005)","edition":"2"},{"key":"1321_CR11","doi-asserted-by":"crossref","unstructured":"Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs. In: Blondel, V., Boyd, S., Kimura, H. (eds.) Recent Advances in Learning and Control. Lecture Notes in Control and Information Sciences, pp. 95\u2013110. Springer-Verlag Limited (2008) http:\/\/stanford.edu\/~boyd\/graph_dcp.html","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"1321_CR12","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx, (2014)"},{"key":"1321_CR13","doi-asserted-by":"crossref","unstructured":"Guo, F., Jiao, L.G.: A new scheme for approximating the weakly efficient solution set of vector rational optimization problems. J. Global Optim. 86(4), 905\u2013930 (2023)","DOI":"10.1007\/s10898-023-01287-8"},{"issue":"4\u20135","key":"1321_CR14","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J.-B., L\u00f6fberg, J.: Gloptipoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24(4\u20135), 761\u2013779 (2009)","journal-title":"Optim. Methods Softw."},{"key":"1321_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17005-8","volume-title":"Vector Optimization, Theory, Applications, and Extensions (2nd)","author":"J Jahn","year":"2011","unstructured":"Jahn, J.: Vector Optimization, Theory, Applications, and Extensions (2nd). Springer, Berlin (2011)"},{"issue":"1","key":"1321_CR16","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1137\/15M1017922","volume":"26","author":"V Jeyakumar","year":"2016","unstructured":"Jeyakumar, V., Lasserre, J.B., Li, G., Pham, T.-S.: Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems. SIAM J. Optim. 26(1), 753\u2013780 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1321_CR17","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s10479-019-03216-z","volume":"296","author":"LG Jiao","year":"2021","unstructured":"Jiao, L.G., Lee, J.H.: Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data. Ann. Oper. Res. 296(1\u20132), 803\u2013820 (2021)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"1321_CR18","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(2), 188\u2013194 (2020)","journal-title":"Oper. Res. Lett."},{"issue":"2\u20133","key":"1321_CR19","first-page":"305","volume":"40","author":"D Kuroiwa","year":"2012","unstructured":"Kuroiwa, D., Lee, G.M.: On robust multiobjective optimization. Vietnam J. Math. 40(2\u20133), 305\u2013317 (2012)","journal-title":"Vietnam J. Math."},{"key":"1321_CR20","volume-title":"Moments. Positive Polynomials and their Applications","author":"JB Lasserre","year":"2010","unstructured":"Lasserre, J.B.: Moments. Positive Polynomials and their Applications. Imperial College Press, London (2010)"},{"issue":"4","key":"1321_CR21","doi-asserted-by":"publisher","first-page":"1995","DOI":"10.1137\/090759240","volume":"20","author":"JB Lasserre","year":"2010","unstructured":"Lasserre, J.B.: A \u201cjoint+ marginal\u2019\u2019 approach to parametric polynomial optimization. SIAM J. Optim. 20(4), 1995\u20132022 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1321_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-010-9628-3","volume":"51","author":"JB Lasserre","year":"2011","unstructured":"Lasserre, J.B.: Min-max and robust polynomial optimization. J. Global Optim. 51(1), 1\u201310 (2011)","journal-title":"J. Global Optim."},{"issue":"1","key":"1321_CR23","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s11750-011-0172-1","volume":"20","author":"J-B Lasserre","year":"2012","unstructured":"Lasserre, J.-B.: An algorithm for semi-infinite polynomial optimization. TOP 20(1), 119\u2013129 (2012)","journal-title":"TOP"},{"key":"1321_CR24","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: An Introduction to Polynomial and Semi-Algebraic Optimization. Cambridge University Press (2015)","DOI":"10.1017\/CBO9781107447226"},{"issue":"2","key":"1321_CR25","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/s10957-018-1222-8","volume":"176","author":"JH Lee","year":"2018","unstructured":"Lee, J.H., Jiao, L.G.: Solving fractional multicriteria optimization problems with sum of squares convex polynomial data. J. Optim. Theory Appl. 176(2), 428\u2013455 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"7","key":"1321_CR26","first-page":"1263","volume":"22","author":"JH Lee","year":"2021","unstructured":"Lee, J.H., Jiao, L.G.: Robust multi-objective optimization with SOS-convex polynomials over a polynomial matrix inequality. J. Nonlinear Convex Anal. 22(7), 1263\u20131284 (2021)","journal-title":"J. Nonlinear Convex Anal."},{"issue":"1","key":"1321_CR27","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10898-020-00969-x","volume":"80","author":"JH Lee","year":"2021","unstructured":"Lee, J.H., Sisarat, N., Jiao, L.G.: Multi-objective convex polynomial optimization and semidefinite programming relaxations. J. Global Optim. 80(1), 117\u2013138 (2021)","journal-title":"J. Global Optim."},{"key":"1321_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-50280-4","volume-title":"Theory of Vector Optimization","author":"DT Luc","year":"1989","unstructured":"Luc, D.T.: Theory of Vector Optimization. Springer, Berlin (1989)"},{"issue":"1","key":"1321_CR29","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10107-012-0589-9","volume":"142","author":"J Nie","year":"2013","unstructured":"Nie, J.: Certifying convergence of Lasserre\u2019s hierarchy via flat truncation. Math. Program. 142(1), 485\u2013510 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"1321_CR30","doi-asserted-by":"publisher","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. 146(1), 97\u2013121 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"1321_CR31","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-014-0797-6","volume":"153","author":"J Nie","year":"2015","unstructured":"Nie, J.: Linear optimization with cones of moments and nonnegative polynomials. Math. Program. 153(1), 247\u2013274 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"1321_CR32","doi-asserted-by":"publisher","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":"1321_CR33","unstructured":"Sawaragi, Y., Nakayama, H., Tanino, T.: Theory of Multiobjective Optimization. Academic Press Inc. (1985)"},{"key":"1321_CR34","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"A Soyster","year":"1973","unstructured":"Soyster, A.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21, 1154\u20131157 (1973)","journal-title":"Oper. Res."},{"issue":"1\u20134","key":"1321_CR35","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using sedumi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01321-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01321-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01321-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T07:30:54Z","timestamp":1707550254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01321-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,21]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1321"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01321-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,21]]},"assertion":[{"value":"13 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}