{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T14:05:44Z","timestamp":1781013944770,"version":"3.54.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s10898-020-00969-x","type":"journal-article","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T02:02:48Z","timestamp":1609725768000},"page":"117-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Multi-objective convex polynomial optimization and semidefinite programming relaxations"],"prefix":"10.1007","volume":"80","author":[{"given":"Jae Hyoung","family":"Lee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nithirat","family":"Sisarat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0105-7749","authenticated-orcid":false,"given":"Liguo","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"issue":"1\u20132","key":"969_CR1","first-page":"380","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\u20132), 380\u2013429 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"969_CR2","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(2), 811\u2013833 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"969_CR3","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.: A Frank\u2013Wolfe type theorem for convex polynomial programs. Comput. Optim. Appl. 22(1), 37\u201348 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"969_CR4","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10898-013-0056-z","volume":"58","author":"V Blanco","year":"2014","unstructured":"Blanco, V., Puerto, J., Ali, S.E.H.B.: A semidefinite programming approach for solving multiobjective linear programming. J. Glob. Optim. 58(3), 465\u2013480 (2014)","journal-title":"J. Glob. Optim."},{"key":"969_CR5","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)"},{"key":"969_CR6","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria optimization, 2nd edn. Springer, Berlin (2005)","edition":"2"},{"key":"969_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF02771779","volume":"153","author":"JF Fernando","year":"2006","unstructured":"Fernando, J.F., Gamboa, J.M.: Polynomial and regular images of $$\\mathbb{R}^n$$. Israel J. Math. 153, 61\u201392 (2006)","journal-title":"Israel J. Math."},{"issue":"18","key":"969_CR8","doi-asserted-by":"publisher","first-page":"5084","DOI":"10.1093\/imrn\/rnt112","volume":"2014","author":"JF Fernando","year":"2014","unstructured":"Fernando, J.F., Ueno, C.: On complements of convex polyhedra as polynomial and regular images of $$\\mathbb{R}^n$$. Int. Math. Res. Not. 2014(18), 5084\u20135123 (2014)","journal-title":"Int. Math. Res. Not."},{"key":"969_CR9","doi-asserted-by":"crossref","unstructured":"Giannessi, F., Mastroeni, G., Pellegrini, L.: On the theory of vector optimization and variational inequalities. Image space analysis and separation. In: F.\u00a0Giannessi (ed.) Vector variational inequalities and vector equilibria: mathematical theories. Nonconvex Optimization and Its Applications, vol.\u00a038, pp. 141\u2013215. Springer, Boston, MA (2000)","DOI":"10.1007\/978-1-4613-0299-5_11"},{"issue":"5","key":"969_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.orl.2012.05.007","volume":"40","author":"BL Gorissen","year":"2012","unstructured":"Gorissen, B.L., Hertog, D.D.: Approximating the Pareto set of multiobjective linear programs via robust optimization. Oper. Res. Lett. 40(5), 319\u2013324 (2012)","journal-title":"Oper. Res. Lett."},{"key":"969_CR11","doi-asserted-by":"publisher","DOI":"10.1142\/q0066","volume-title":"Genericity in polynomial optimization","author":"HV H\u00e0","year":"2017","unstructured":"H\u00e0, H.V., Ph\u1ea1m, T.S.: Genericity in polynomial optimization. World Scientific Publishing, Singapore (2017)"},{"issue":"1","key":"969_CR12","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.W.: Semidefinite representation of convex sets. Math. Program. 122(1), 21\u201364 (2010)","journal-title":"Math. Program."},{"key":"969_CR13","series-title":"Lecture notes in control and information science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/10997703_15","volume-title":"Positive polynomials in control","author":"D Henrion","year":"2005","unstructured":"Henrion, D., Lasserre, J.B.: Detecting global optimality and extracting solutions in gloptipoly. In: Henrion, D., Garulli, A. (eds.) Positive polynomials in control. Lecture notes in control and information science, vol. 312, pp. 293\u2013310. Springer, Berlin (2005)"},{"issue":"4\u20135","key":"969_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., Loefberg, J.: Gloptipoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24(4\u20135), 761\u2013779 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"969_CR15","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.: Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness. Oper. Res. Lett. 42(1), 34\u201340 (2014)","journal-title":"Oper. Res. Lett."},{"key":"969_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-019-03216-z","author":"LG Jiao","year":"2019","unstructured":"Jiao, L.G., Lee, J.H.: Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data. Ann. Oper. Res. (2019). https:\/\/doi.org\/10.1007\/s10479-019-03216-z","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"969_CR17","first-page":"1021","volume":"24","author":"LG Jiao","year":"2020","unstructured":"Jiao, L.G., Lee, J.H., Ogata, Y., Tanaka, T.: Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint. Taiwan. J. Math. 24(4), 1021\u20131043 (2020)","journal-title":"Taiwan. J. Math."},{"issue":"2","key":"969_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."},{"key":"969_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01532-y","author":"DS Kim","year":"2020","unstructured":"Kim, D.S., Mordukhovich, B.S., Ph\u1ea1m, T.S., Tuyen, N.V.: Existence of efficient and properly efficient solutions to problems of constrained vector optimization. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01532-y","journal-title":"Math. Program."},{"issue":"1\u20132","key":"969_CR20","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-018-1271-7","volume":"177","author":"DS Kim","year":"2019","unstructured":"Kim, D.S., Ph\u1ea1m, T.S., Tuyen, N.V.: On the existence of Pareto solutions for polynomial vector optimization problems. Math. Program. 177(1\u20132), 321\u2013341 (2019)","journal-title":"Math. Program."},{"issue":"3","key":"969_CR21","doi-asserted-by":"publisher","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":"4","key":"969_CR22","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(4), 1995\u20132014 (2009)","journal-title":"SIAM J. Optim."},{"key":"969_CR23","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)"},{"key":"969_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107447226","volume-title":"An introduction to polynomial and semi-algebraic optimization","author":"JB Lasserre","year":"2015","unstructured":"Lasserre, J.B.: An introduction to polynomial and semi-algebraic optimization. Cambridge University Press, Cambridge (2015)"},{"issue":"2","key":"969_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":"6","key":"969_CR26","first-page":"1535","volume":"23","author":"JH Lee","year":"2019","unstructured":"Lee, J.H., Jiao, L.G.: Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials. Taiwan. J. Math. 23(6), 1535\u20131550 (2019)","journal-title":"Taiwan. J. Math."},{"key":"969_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21091-9","volume-title":"Multiobjective linear programming: an introduction","author":"DT Luc","year":"2016","unstructured":"Luc, D.T.: Multiobjective linear programming: an introduction. Springer International Publishing, Switzerland (2016)"},{"issue":"6\u20137","key":"969_CR28","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.orl.2014.07.007","volume":"42","author":"V Magron","year":"2014","unstructured":"Magron, V., Henrion, D., Lasserre, J.B.: Approximating Pareto curves using semidefinite relaxations. Oper. Res. Lett. 42(6\u20137), 432\u2013437 (2014)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132","key":"969_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\u20132), 485\u2013510 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"969_CR30","doi-asserted-by":"publisher","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":"4","key":"969_CR31","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1287\/moor.2018.0974","volume":"44","author":"TS Ph\u1ea1m","year":"2019","unstructured":"Ph\u1ea1m, T.S.: Optimality conditions for minimizers at infinity in polynomial programming. Math. Oper. Res. 44(4), 1381\u20131395 (2019)","journal-title":"Math. Oper. Res."},{"key":"969_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-65919-0","volume-title":"Linear programming using MatLab","author":"N Ploskas","year":"2017","unstructured":"Ploskas, N., Samaras, N.: Linear programming using MatLab. Springer, Switzerland (2017)"},{"issue":"3","key":"969_CR33","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."},{"issue":"7","key":"969_CR34","first-page":"585","volume":"328","author":"M Putinar","year":"1999","unstructured":"Putinar, M., Vasilescu, F.H.: Positive polynomials on semi-algebraic sets. C. R. Acad. Sci. I Math. 328(7), 585\u2013589 (1999)","journal-title":"C. R. Acad. Sci. I Math."},{"issue":"4","key":"969_CR35","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s00209-003-0568-1","volume":"245","author":"C Scheiderer","year":"2003","unstructured":"Scheiderer, C.: Sums of squares on real algebraic curves. Math. Z. 245(4), 725\u2013760 (2003)","journal-title":"Math. Z."},{"issue":"2","key":"969_CR36","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.: Distinguished representations of non-negative polynomials. J. Algebra 289(2), 558\u2013573 (2005)","journal-title":"J. Algebra"},{"issue":"2","key":"969_CR37","doi-asserted-by":"publisher","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(2), 203\u2013206 (1991)","journal-title":"Math. Ann."},{"issue":"3","key":"969_CR38","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1137\/S1052623403431779","volume":"15","author":"M Schweighofer","year":"2005","unstructured":"Schweighofer, M.: Optimization of polynomials on compact semialgebraic sets. SIAM J. Optim. 15(3), 805\u2013825 (2005)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"969_CR39","doi-asserted-by":"publisher","first-page":"981","DOI":"10.4171\/RMI\/563","volume":"24","author":"C Ueno","year":"2008","unstructured":"Ueno, C.: A note on boundaries of open polynomial images of $$\\mathbb{R}^2$$. Rev. Mat. Iberoam. 24(3), 981\u2013988 (2008)","journal-title":"Rev. Mat. Iberoam."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00969-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00969-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00969-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T06:15:14Z","timestamp":1621318514000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00969-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,4]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["969"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00969-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,4]]},"assertion":[{"value":"6 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}