{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:34:20Z","timestamp":1773840860639,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper studies distributionally robust optimization (DRO) when the ambiguity set is given by moments for the distributions. The objective and constraints are given by polynomials in decision variables. We reformulate the DRO with equivalent moment conic constraints. Under some general assumptions, we prove the DRO is equivalent to a linear optimization problem with moment and psd polynomial cones. A Moment-SOS relaxation method is proposed to solve it. Its asymptotic and finite convergence are shown under certain assumptions. Numerical examples are presented to show how to solve DRO problems.<\/jats:p>","DOI":"10.1007\/s10915-022-02063-8","type":"journal-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T15:07:59Z","timestamp":1669907279000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Distributionally Robust Optimization with Moment Ambiguity Sets"],"prefix":"10.1007","volume":"94","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2637-8274","authenticated-orcid":false,"given":"Jiawang","family":"Nie","sequence":"first","affiliation":[]},{"given":"Liu","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Suhan","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Guangming","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,1]]},"reference":[{"key":"2063_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust Optim.","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optim., vol. 28. Princeton University Press, New Jersey (2009)"},{"issue":"2","key":"2063_CR2","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/mnsc.1120.1641","volume":"59","author":"A Ben-Tal","year":"2013","unstructured":"Ben-Tal, A., Den Hertog, D., et al.: Robust solutions of optimization problems affected by uncertain probabilities. Manag. Sci. 59(2), 341\u2013357 (2013)","journal-title":"Manag. Sci."},{"key":"2063_CR3","volume-title":"Lectures on modern convex optimization","author":"A Ben-Tal","year":"2012","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization. SIAM, Philadelphia, PA (2012)"},{"issue":"3","key":"2063_CR4","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"issue":"2","key":"2063_CR5","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1287\/mnsc.2017.2952","volume":"65","author":"D Bertsimas","year":"2019","unstructured":"Bertsimas, D., Sim, M., Zhang, M.: Adaptive distributionally robust optimization. Manag. Sci. 65(2), 604\u2013618 (2019)","journal-title":"Manag. Sci."},{"key":"2063_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to stochastic programming","author":"J Birge","year":"2011","unstructured":"Birge, J., Louveaux, F.: Introduction to stochastic programming. Springer, Newyork (2011)"},{"issue":"1","key":"2063_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10589-020-00234-7","volume":"78","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Sun, H., Xu, H.: Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems. Comput. Optim. Appl. 78(1), 205\u2013238 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"2063_CR8","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1287\/opre.2018.1799","volume":"67","author":"Z Chen","year":"2019","unstructured":"Chen, Z., Sim, M., Xu, H.: Distributionally robust optimization with infinitely constrained ambiguity sets. Oper. Res. 67(5), 1328\u20131344 (2019)","journal-title":"Oper. Res."},{"key":"2063_CR9","first-page":"603","volume":"17","author":"R Curto","year":"1991","unstructured":"Curto, R., Fialkow, L.: Recursiveness, positivity, and truncated moment problems. Houston J. Math. 17, 603\u2013635 (1991)","journal-title":"Houston J. Math."},{"key":"2063_CR10","first-page":"189","volume":"54","author":"R Curto","year":"2005","unstructured":"Curto, R., Fialkow, L.: Truncated $$K$$-moment problems in several variables. J. Oper. Theory 54, 189\u2013226 (2005)","journal-title":"J. Oper. Theory"},{"issue":"3","key":"2063_CR11","doi-asserted-by":"crossref","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."},{"key":"2063_CR12","unstructured":"Duchi, J., Namkoong, H.: Learning models with uniform performance via distributionally robust optimization, Preprint, (2018). arXiv:1810.08750"},{"issue":"1\u20132","key":"2063_CR13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-017-1172-1","volume":"171","author":"P Esfahani","year":"2018","unstructured":"Esfahani, P., Kuhn, D.: Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations. Math. Program. 171(1\u20132), 115\u2013166 (2018)","journal-title":"Math. Program."},{"issue":"4","key":"2063_CR14","doi-asserted-by":"crossref","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first-and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2063_CR15","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s10013-021-00534-3","volume":"50","author":"B Guo","year":"2022","unstructured":"Guo, B., Nie, J., Yang, Z.: Learning diagonal gaussian mixture models and incomplete tensor decompositions. Vietnam J. Math. 50(2), 421\u2013446 (2022)","journal-title":"Vietnam J. Math."},{"key":"2063_CR16","unstructured":"G\u00fcrb\u00fczbalaban, M., Ruszczy\u0144ski, A.: Zhu, L.: A stochastic subgradient method for distributionally robust non-convex learning, Preprint, (2020). arXiv:2006.04873"},{"issue":"1","key":"2063_CR17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10107-015-0896-z","volume":"151","author":"G Hanasusanto","year":"2015","unstructured":"Hanasusanto, G., Roitch, V., et al.: A distributionally robust perspective on uncertainty quantification and chance constrained programming. Math. Program. 151(1), 35\u201362 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"2063_CR18","doi-asserted-by":"crossref","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(1), 21\u201364 (2010)","journal-title":"Math. Program."},{"key":"2063_CR19","volume-title":"Detecting global optimality and extracting solutions in GloptiPoly, Positive polynomials in control, 293\u2013310","author":"D Henrion","year":"2005","unstructured":"Henrion, D., Lasserre, J.: Detecting global optimality and extracting solutions in GloptiPoly, Positive polynomials in control, 293\u2013310. Springer, Berlin, Heidelberg (2005)"},{"issue":"4\u20135","key":"2063_CR20","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J., Loefberg, J.: GloptiPoly3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24(4\u20135), 761\u2013779 (2009)","journal-title":"Optim. Methods Softw."},{"key":"2063_CR21","doi-asserted-by":"crossref","DOI":"10.1142\/q0252","volume-title":"The moment-SOS hierarchy","author":"D Henrion","year":"2020","unstructured":"Henrion, D., Korda, M., Lasserre, J.: The moment-SOS hierarchy. World Scientific, Singapore (2020)"},{"key":"2063_CR22","doi-asserted-by":"crossref","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."},{"key":"2063_CR23","doi-asserted-by":"crossref","DOI":"10.1090\/mmono\/050","volume-title":"The Markov moment problem and extremal problems","author":"M Krein","year":"1977","unstructured":"Krein, M., Louvish, D.: The Markov moment problem and extremal problems. American Mathematical Society, Washington, D.C (1977)"},{"key":"2063_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-39568-1","volume-title":"First-order and stochastic optimization methods for machine learning","author":"G Lan","year":"2020","unstructured":"Lan, G.: First-order and stochastic optimization methods for machine learning. Springer, Newyork (2020)"},{"key":"2063_CR25","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J Lasserre","year":"2001","unstructured":"Lasserre, J.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"2063_CR26","doi-asserted-by":"crossref","first-page":"1995","DOI":"10.1137\/080728214","volume":"19","author":"J Lasserre","year":"2009","unstructured":"Lasserre, J.: Convexity in semi-algebraic geometry and polynomial optimization. SIAM J. Optim. 19, 1995\u20132014 (2009)","journal-title":"SIAM J. Optim."},{"key":"2063_CR27","doi-asserted-by":"crossref","DOI":"10.1142\/p665","volume-title":"Moment, Positive Polynomials and Their Applications","author":"J Lasserre","year":"2009","unstructured":"Lasserre, J.: Moment, Positive Polynomials and Their Applications. Imperial College Press, London (2009)"},{"issue":"1","key":"2063_CR28","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10107-019-01434-8","volume":"185","author":"J Lasserre","year":"2021","unstructured":"Lasserre, J., Weisser, T.: Distributionally robust polynomial chance-constraints under mixture ambiguity sets. Math. Program. 185(1), 409\u2013453 (2021)","journal-title":"Math. Program."},{"key":"2063_CR29","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials, Emerging Applications of Algebraic Geometry of IMA Volumes in Mathematics and its Applications 149, pp. 157\u2013270, Springer, (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"key":"2063_CR30","unstructured":"Lofberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB, IEEE international conference on robotics and automation (IEEE Cat. No. 04CH37508), IEEE, (2004)"},{"key":"2063_CR31","first-page":"37","volume":"26","author":"M Mevissen","year":"2013","unstructured":"Mevissen, M., Ragnoli, E., Yu, J.: Data-driven distributionally robust polynomial optimization. Adv. Neural Inf. Process. Syst. 26, 37\u201345 (2013)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2063_CR32","unstructured":"Mohri, M., Sivek, G., Suresh A.:, Agnostic federated learning, Preprint, (2019). arXiv:1902.00146"},{"key":"2063_CR33","doi-asserted-by":"crossref","first-page":"3072","DOI":"10.1016\/j.laa.2010.02.005","volume":"432","author":"T Netzer","year":"2010","unstructured":"Netzer, T.: On semidefinite representations of non-closed sets. Linear Algebra Appl. 432, 3072\u20133078 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"1\u20132","key":"2063_CR34","doi-asserted-by":"crossref","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":"6","key":"2063_CR35","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1007\/s10208-014-9225-9","volume":"14","author":"J Nie","year":"2014","unstructured":"Nie, J.: The $${\\cal{A} }$$-truncated $$K$$-moment problem. Found. Comput. Math. 14(6), 1243\u20131276 (2014)","journal-title":"Found. Comput. Math."},{"issue":"1\u20132","key":"2063_CR36","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. 146(1\u20132), 97\u2013121 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"2063_CR37","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s10107-014-0845-2","volume":"151","author":"J Nie","year":"2015","unstructured":"Nie, J.: The hierarchy of local minimums in polynomial optimization. Math. Program. 151(2), 555\u2013583 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"2063_CR38","doi-asserted-by":"crossref","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":"2","key":"2063_CR39","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1080\/10556788.2019.1649672","volume":"35","author":"J Nie","year":"2020","unstructured":"Nie, J., Yang, L., Zhong, S.: Stochastic polynomial optimization. Optim. Methods Softw. 35(2), 329\u2013347 (2020)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"2063_CR40","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1080\/14697680701455410","volume":"7","author":"G Pflug","year":"2007","unstructured":"Pflug, G., Wozabal, D.: Ambiguity in portfolio selection. Quantitative Finance 7(4), 435\u2013442 (2007)","journal-title":"Quantitative Finance"},{"issue":"3","key":"2063_CR41","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/opre.2017.1688","volume":"66","author":"K Postek","year":"2018","unstructured":"Postek, K., Ben-Tal, A., et al.: Robust optimization with ambiguous stochastic constraints under mean and dispersion information. Oper. Res. 66(3), 814\u2013833 (2018)","journal-title":"Oper. Res."},{"issue":"3","key":"2063_CR42","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."},{"issue":"4","key":"2063_CR43","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1287\/moor.27.4.792.304","volume":"27","author":"S Rachev","year":"2002","unstructured":"Rachev, S., R\u00f6misch, W.: Quantitative stability in stochastic programming: the method of probability metrics. Math. Oper. Res. 27(4), 792\u2013818 (2002)","journal-title":"Math. Oper. Res."},{"key":"2063_CR44","unstructured":"Rahimian, H., Mehrotra, S.: Distributionally robust optimization: A review, Preprint, (2019). arXiv:1908.05659"},{"key":"2063_CR45","doi-asserted-by":"crossref","unstructured":"Ruszczy\u0144ski, A., Shapiro, A., (Eds.), Stochastic programming models, Handbook in Operations Research and Management Science, Elsevier Science, Amsterdam, (2003)","DOI":"10.1016\/S0927-0507(03)10001-1"},{"issue":"4","key":"2063_CR46","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1137\/S1052623403434012","volume":"14","author":"A Shapiro","year":"2004","unstructured":"Shapiro, A., Ahmed, S.: On a class of minimax stochastic programs. SIAM J. Optim. 14(4), 1237\u20131249 (2004)","journal-title":"SIAM J. Optim."},{"key":"2063_CR47","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973433","volume-title":"Lectures on stochastic programming: modeling and theory","author":"A Shapiro","year":"2014","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on stochastic programming: modeling and theory. SIAM, Philadelphia (2014)"},{"issue":"1\u20134","key":"2063_CR48","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J Sturm","year":"1999","unstructured":"Sturm, J.: 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."},{"key":"2063_CR49","doi-asserted-by":"publisher","unstructured":"Sun, H., Shapiro, A., Chen, X.: Distributionally robust stochastic variational inequalities. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-022-01889-2","DOI":"10.1007\/s10107-022-01889-2"},{"issue":"6","key":"2063_CR50","doi-asserted-by":"crossref","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."},{"issue":"2","key":"2063_CR51","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s10107-017-1143-6","volume":"169","author":"H Xu","year":"2018","unstructured":"Xu, H., Liu, Y., Sun, H.: Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods. Math. Program. 169(2), 489\u2013529 (2018)","journal-title":"Math. Program."},{"issue":"4","key":"2063_CR52","doi-asserted-by":"crossref","first-page":"3743","DOI":"10.1109\/TSG.2018.2834564","volume":"10","author":"Y Yang","year":"2018","unstructured":"Yang, Y., Wu, W.: A distributionally robust optimization model for real-time power dispatch in distribution networks. IEEE Trans. Smart Grid 10(4), 3743\u20133752 (2018)","journal-title":"IEEE Trans. Smart Grid"},{"issue":"3","key":"2063_CR53","doi-asserted-by":"crossref","first-page":"1855","DOI":"10.1137\/15M1038529","volume":"26","author":"J Zhang","year":"2016","unstructured":"Zhang, J., Xu, H., Zhang, L.: Quantitative stability analysis for distributionally robust optimization with moment constraints. SIAM Optim. 26(3), 1855\u20131862 (2016)","journal-title":"SIAM Optim."},{"key":"2063_CR54","unstructured":"Zhang, Z., Ahmed, S., Lan, G.: Efficient algorithms for distributionally robust stochastic optimization with discrete scenario support, Preprint, (2019). arXiv:1909.11216"},{"issue":"5","key":"2063_CR55","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1287\/opre.1080.0684","volume":"57","author":"S Zhu","year":"2009","unstructured":"Zhu, S., Fukushima, Masao: Worst-case conditional value-at-risk with application to robust portfolio management. Oper. Res. 57(5), 1155\u20131168 (2009)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"2063_CR56","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10107-011-0494-7","volume":"137","author":"S Zymler","year":"2013","unstructured":"Zymler, S., Kuhn, D., Rustem, B.: Distributionally robust joint chance constraints with second-order moment information. Math. Program. 137(1\u20132), 167\u2013198 (2013)","journal-title":"Math. Program."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-02063-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-022-02063-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-02063-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T20:04:47Z","timestamp":1728504287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-022-02063-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,1]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["2063"],"URL":"https:\/\/doi.org\/10.1007\/s10915-022-02063-8","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,1]]},"assertion":[{"value":"31 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"12"}}