{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T04:58:08Z","timestamp":1781153888969,"version":"3.54.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T00:00:00Z","timestamp":1778198400000},"content-version":"vor","delay-in-days":7,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001773","name":"University of New South Wales","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001773","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This paper investigates the minimization of the expectation of piecewise polynomial loss functions over Wasserstein balls. This optimization problem often appears as a key sub-problem of distributionally robust optimization problems. We establish the asymptotic convergence of a hierarchy of semi-definite programming (SDP) relaxations, providing a framework for approximating the optimal values of these inherently infinite-dimensional optimization problems. A central foundational contribution is the development of a new lifted positivity certificate: we demonstrate that piecewise polynomials positive over Archimedean basic semi-algebraic sets admit a structured system of sum-of-squares (SOS) representations. Furthermore, we prove that the proposed hierarchy achieves finite convergence under suitable conditions when the defining polynomials are convex. The practical utility and versatility of this approach are demonstrated via numerical experiments in revenue estimation and portfolio optimization.<\/jats:p>","DOI":"10.1007\/s10957-026-02999-z","type":"journal-article","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T05:50:26Z","timestamp":1778219426000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Convergent Lifted Lasserre Hierarchy of SDPs for Minimizing Expectation of Piecewise Polynomial Loss over Wasserstein Balls"],"prefix":"10.1007","volume":"209","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8664-2255","authenticated-orcid":false,"given":"Neil De Vera","family":"Dizon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Queenie Yingkun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thai Doan","family":"Chuong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guoyin","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vaithilingam","family":"Jeyakumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,8]]},"reference":[{"issue":"2","key":"2999_CR1","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 Journal on Applied Algebra and Geometry 3(2), 193\u2013230 (2019)","journal-title":"SIAM Journal on Applied Algebra and Geometry"},{"issue":"2","key":"2999_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":"2","key":"2999_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/moor.1080.0362","volume":"34","author":"A Auslender","year":"2009","unstructured":"Auslender, A., Goberna, M.A., L\u00f3pez, M.A.: Penalty and smoothing methods for convex semi-infinite programming. Math. Oper. Res. 34(2), 303\u2013319 (2009)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2999_CR4","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10107-024-02072-5","volume":"209","author":"F Bach","year":"2025","unstructured":"Bach, F.: Sum-of-squares relaxations for polynomial min-max problems over simple sets. Math. Program. 209(1), 475\u2013501 (2025)","journal-title":"Math. Program."},{"key":"2999_CR5","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization, vol. 28. Princeton University Press, Princeton (2009)"},{"issue":"3","key":"2999_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1177\/0148558X8700200301","volume":"2","author":"H Benishay","year":"1987","unstructured":"Benishay, H.: A fourth-degree polynomial utility function and its implications for investors\u2019 responses toward four moments of the wealth distribution. Journal of Accounting, Auditing & Finance 2(3), 203\u2013228 (1987)","journal-title":"Journal of Accounting, Auditing & Finance"},{"issue":"2","key":"2999_CR7","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1287\/moor.2018.0936","volume":"44","author":"J Blanchet","year":"2019","unstructured":"Blanchet, J., Murthy, K.: Quantifying distributional model risk via optimal transport. Math. Oper. Res. 44(2), 565\u2013600 (2019)","journal-title":"Math. Oper. Res."},{"key":"2999_CR8","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2013","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer Science & Business Media, New York (2013)"},{"issue":"4","key":"2999_CR9","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. Global Optim. 75(4), 885\u2013919 (2019)","journal-title":"J. Global Optim."},{"key":"2999_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10107-019-01429-5","volume":"181","author":"E de Klerk","year":"2020","unstructured":"de Klerk, E., Kuhn, D., Postek, K.: Distributionally robust optimization with polynomial densities: Theory, models and algorithms. Math. Program. 181, 265\u2013296 (2020)","journal-title":"Math. Program."},{"issue":"3","key":"2999_CR11","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1137\/100814147","volume":"21","author":"E De Klerk","year":"2011","unstructured":"De Klerk, E., Laurent, M.: On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems. SIAM J. Optim. 21(3), 824\u2013832 (2011)","journal-title":"SIAM J. Optim."},{"key":"2999_CR12","doi-asserted-by":"crossref","unstructured":"de Klerk, E., Laurent, M.: A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis. In World Women in Mathematics 2018, pp. 17\u201356, Switzerland, . Springer (2019)","DOI":"10.1007\/978-3-030-21170-7_1"},{"issue":"3","key":"2999_CR13","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/opre.1090.0741","volume":"58","author":"E Delage","year":"2010","unstructured":"Delage, E., Ye, Y.: Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3), 595\u2013612 (2010)","journal-title":"Oper. Res."},{"issue":"2","key":"2999_CR14","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1287\/moor.2022.1275","volume":"48","author":"R Gao","year":"2023","unstructured":"Gao, R., Kleywegt, A.: Distributionally robust stochastic optimization with Wasserstein distance. Math. Oper. Res. 48(2), 603\u2013655 (2023)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"2999_CR15","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1080\/10920277.1998.10595728","volume":"2","author":"HU Gerber","year":"1998","unstructured":"Gerber, H.U., Pafum, G.: Utility functions: From risk theory to finance. North American Actuarial Journal 2(3), 74\u201391 (1998)","journal-title":"North American Actuarial Journal"},{"issue":"2","key":"2999_CR16","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(02)00327-2","volume":"143","author":"MA Goberna","year":"2002","unstructured":"Goberna, M.A., Lopez, M.A.: Linear semi-infinite programming theory: An updated survey. Eur. J. Oper. Res. 143(2), 390\u2013405 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2999_CR17","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.1137\/13094712X","volume":"25","author":"S Han","year":"2015","unstructured":"Han, S., Tao, M., Topcu, U., Owhadi, H., Murray, R.M.: Convex optimal uncertainty quantification. SIAM J. Optim. 25(3), 1368\u20131387 (2015)","journal-title":"SIAM J. Optim."},{"key":"2999_CR18","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."},{"issue":"2","key":"2999_CR19","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1007\/s10107-022-01796-6","volume":"198","author":"N Ho-Nguyen","year":"2023","unstructured":"Ho-Nguyen, N., Wright, S.J.: Adversarial classification via distributional robustness with Wasserstein ambiguity. Math. Program. 198(2), 1411\u20131447 (2023)","journal-title":"Math. Program."},{"key":"2999_CR20","doi-asserted-by":"crossref","unstructured":"Huang, Q., Jeyakumar, V., Li, G.: Piecewise SOS-convex moment optimization and applications via exact semi-definite programs. EURO J. Comp. Optim., p. 100094, (2024)","DOI":"10.1016\/j.ejco.2024.100094"},{"key":"2999_CR21","doi-asserted-by":"crossref","unstructured":"Huang, Q., Jeyakumar, V., Li, G., Huyen, D.: Convexifiable quadratic inequality systems: New minimax S-lemma and exact SOCPs for classes of distributionally robust optimization problems. J. Glob. Optim., pp. 1\u201334, (2025)","DOI":"10.1007\/s10898-025-01499-0"},{"issue":"1","key":"2999_CR22","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., Pham, T., 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":"2999_CR23","doi-asserted-by":"crossref","unstructured":"Kuhn, D., Mohajerin\u00a0Esfahani, P., Nguyen, V.\u00a0A., Shafieezadeh-Abadeh, S.: Wasserstein distributionally robust optimization: Theory and applications in machine learning. In Operations Research & Management Science in the Age of Analytics, pp. 130\u2013166. Informs, (2019)","DOI":"10.1287\/educ.2019.0198"},{"key":"2999_CR24","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1017\/S0962492924000084","volume":"34","author":"D Kuhn","year":"2025","unstructured":"Kuhn, D., Shafiee, S., Wiesemann, W.: Distributionally Robust Optimization. Acta Numer 34, 579\u2013804 (2025)","journal-title":"Acta Numer"},{"key":"2999_CR25","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s10107-010-0353-y","volume":"131","author":"R Laraki","year":"2012","unstructured":"Laraki, R., Lasserre, J.B.: Semidefinite programming for min-max problems and games. Math. Program. 131, 305\u2013332 (2012)","journal-title":"Math. Program."},{"key":"2999_CR26","doi-asserted-by":"publisher","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, 65\u201392 (2008)","journal-title":"Math. Program."},{"issue":"4","key":"2999_CR27","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":"2999_CR28","doi-asserted-by":"crossref","DOI":"10.1142\/p665","volume-title":"Moments, Positive Polynomials and Their Applications","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Moments, Positive Polynomials and Their Applications, vol. 1. World Scientific, London (2009)"},{"key":"2999_CR29","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, vol. 52. Cambridge University Press, Cambridge (2015)"},{"issue":"1","key":"2999_CR30","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-017-1172-1","volume":"171","author":"P MohajerinEsfahani","year":"2018","unstructured":"MohajerinEsfahani, P., Kuhn, D.: Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Math. Program. 171(1), 115\u2013166 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"2999_CR31","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s10915-022-02063-8","volume":"94","author":"J Nie","year":"2023","unstructured":"Nie, J., Yang, L., Zhong, S., Zhou, G.: Distributionally robust optimization with moment ambiguity sets. J. Sci. Comput. 94(1), 12 (2023)","journal-title":"J. Sci. Comput."},{"key":"2999_CR32","doi-asserted-by":"crossref","unstructured":"Pflug, G.\u00a0C., Pichler, A.: Multistage Stochastic Optimization, vol. 1104. Springer, (2014)","DOI":"10.1007\/978-3-319-08843-3"},{"issue":"3","key":"2999_CR33","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1287\/moor.1040.0137","volume":"30","author":"I Popescu","year":"2005","unstructured":"Popescu, I.: A semidefinite programming approach to optimal-moment bounds for convex classes of distributions. Math. Oper. Res. 30(3), 632\u2013657 (2005)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"2999_CR34","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1137\/151005221","volume":"58","author":"K Postek","year":"2016","unstructured":"Postek, K., den Hertog, D., Melenberg, B.: Computationally tractable counterparts of distributionally robust constraints on risk measures. SIAM Rev. 58(4), 603\u2013650 (2016)","journal-title":"SIAM Rev."},{"issue":"3","key":"2999_CR35","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":"2999_CR36","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar, R.T., Uryasev, S.: Optimization of conditional value-at-risk. J. Risk 2, 21\u201342 (2000)","journal-title":"Risk"},{"key":"2999_CR37","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, 725\u2013760 (2003)","journal-title":"Math. Z."},{"key":"2999_CR38","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10107-017-1220-x","volume":"173","author":"BP Van Parys","year":"2019","unstructured":"Van Parys, B.P., Goulart, P.J., Morari, M.: Distributionally robust expectation inequalities for structured distributions. Math. Program. 173, 251\u2013280 (2019)","journal-title":"Math. Program."},{"key":"2999_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-017-0121-6","volume":"10","author":"T Weisser","year":"2018","unstructured":"Weisser, T., Lasserre, J.B., Toh, K.-C.: Sparse-BSOS: A bounded degree SOS hierarchy for large scale polynomial optimization with sparsity. Math. Program. Comput. 10, 1\u201332 (2018)","journal-title":"Math. Program. Comput."},{"issue":"6","key":"2999_CR40","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1287\/opre.2014.1314","volume":"62","author":"W Wiesemann","year":"2014","unstructured":"Wiesemann, W., Kuhn, D., Sim, M.: Distributionally robust convex optimization. Oper. Res. 62(6), 1358\u20131376 (2014)","journal-title":"Oper. Res."},{"key":"2999_CR41","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10479-010-0812-0","volume":"193","author":"D Wozabal","year":"2012","unstructured":"Wozabal, D.: A framework for optimization under ambiguity. Ann. Oper. Res. 193, 21\u201347 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"2999_CR42","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s10107-021-01673-8","volume":"195","author":"M-C Yue","year":"2022","unstructured":"Yue, M.-C., Kuhn, D., Wiesemann, W.: On linear optimization over Wasserstein balls. Math. Program. 195(1), 1107\u20131122 (2022)","journal-title":"Math. Program."},{"key":"2999_CR43","doi-asserted-by":"publisher","DOI":"10.1142\/5021","volume-title":"Convex Analysis in General Vector Spaces","author":"C Zalinescu","year":"2002","unstructured":"Zalinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)"},{"key":"2999_CR44","unstructured":"Zhen, J., Kuhn, D., Wiesemann, W.: A unified theory of robust and distributionally robust optimization via the primal-worst-equals-dual-best principle. Operations Research, (2023)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-02999-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-026-02999-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-02999-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T04:13:30Z","timestamp":1781151210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-026-02999-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["2999"],"URL":"https:\/\/doi.org\/10.1007\/s10957-026-02999-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"11 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The last two authors declare that they are Associate Editors for the Journal of Optimization Theory and Applications. The other three authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"61"}}