{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T16:48:15Z","timestamp":1742057295281,"version":"3.38.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T00:00:00Z","timestamp":1727395200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T00:00:00Z","timestamp":1727395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"The Project of Huzhou Science and Technology","award":["2023GZ68"],"award-info":[{"award-number":["2023GZ68"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s11590-024-02150-9","type":"journal-article","created":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T04:02:19Z","timestamp":1727668939000},"page":"551-577","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robust satisficing model with Sinkhorn distance"],"prefix":"10.1007","volume":"19","author":[{"given":"Shuang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liping","family":"Pang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,27]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Azizian, W., Iutzeler, F., Malick, J.: Regularization for Wasserstein distributionally robust optimization (2023). https:\/\/doi.org\/10.48550\/arXiv.2205.08826","key":"2150_CR1","DOI":"10.48550\/arXiv.2205.08826"},{"key":"2150_CR2","volume-title":"Convex Optimization Theory","author":"D Bertsekas","year":"2009","unstructured":"Bertsekas, D.: Convex Optimization Theory. Athena Scientific, Belmont (2009)"},{"key":"2150_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/9781119721871.ch1","volume-title":"Semi-supervised learning based on distributionally robust optimization","author":"J Blanchet","year":"2020","unstructured":"Blanchet, J., Kang, Y.: Semi-supervised learning based on distributionally robust optimization, pp. 1\u201333. Wiley, New York (2020). https:\/\/doi.org\/10.1002\/9781119721871.ch1"},{"issue":"2","key":"2150_CR4","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). https:\/\/doi.org\/10.1287\/moor.2018.0936","journal-title":"Math. Oper. Res."},{"key":"2150_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, USA (2004)"},{"doi-asserted-by":"publisher","unstructured":"Courty, N., Flamary, R., Habrard, A., Rakotomamonjy, A.: Joint distribution optimal transportation for domain adaptation. In: Proceedings of the 31st International Conference on Neural Information Processing Systems. NIPS\u201917, pp. 3733\u20133742. Curran Associates Inc., Long Beach, California, USA (2017). https:\/\/doi.org\/10.48550\/arXiv.1705.08848","key":"2150_CR6","DOI":"10.48550\/arXiv.1705.08848"},{"issue":"4","key":"2150_CR7","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1111\/poms.13920","volume":"32","author":"Z Cui","year":"2023","unstructured":"Cui, Z., Ding, J., Long, D.Z., Zhang, L.: Target-based resource pooling problem. Prod. Oper. Manag. 32(4), 1187\u20131204 (2023). https:\/\/doi.org\/10.1111\/poms.13920","journal-title":"Prod. Oper. Manag."},{"doi-asserted-by":"publisher","unstructured":"Cuturi, M.: Sinkhorn distances: Lightspeed computation of optimal transport. In: Proceedings of the 26th International Conference on Neural Information Processing Systems-Volume 2. NIPS\u201913, pp. 2292\u20132300. Curran Associates Inc., Lake Tahoe, Nevada (2013). https:\/\/doi.org\/10.48550\/arXiv.1306.0895","key":"2150_CR8","DOI":"10.48550\/arXiv.1306.0895"},{"doi-asserted-by":"publisher","unstructured":"Feng, Y., Schl\u00f6gl, E.: Model risk measurement under Wasserstein distance (2019). https:\/\/doi.org\/10.48550\/arXiv.1809.03641","key":"2150_CR9","DOI":"10.48550\/arXiv.1809.03641"},{"issue":"3","key":"2150_CR10","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s00440-014-0583-7","volume":"162","author":"N Fournier","year":"2015","unstructured":"Fournier, N., Guillin, A.: On the rate of convergence in Wasserstein distance of the empirical measure. Prob. Theory Relat. Fields 162(3), 707\u2013738 (2015)","journal-title":"Prob. Theory Relat. Fields"},{"key":"2150_CR11","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2022.1275","author":"R Gao","year":"2022","unstructured":"Gao, R., Kleywegt, A.: Distributionally robust stochastic optimization with Wasserstein distance. Math. Operat. Res. (2022). https:\/\/doi.org\/10.1287\/moor.2022.1275","journal-title":"Math. Operat. Res."},{"doi-asserted-by":"publisher","unstructured":"Genevay, A., Peyre, G., Cuturi, M.: Learning generative models with Sinkhorn divergences. In: Proceedings of the 21st International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, pp. 1608\u20131617. PMLR, Lanzarote, Spain (2018). https:\/\/doi.org\/10.48550\/arXiv.1706.00292","key":"2150_CR12","DOI":"10.48550\/arXiv.1706.00292"},{"issue":"4","key":"2150_CR13","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1214\/009053604000000553","volume":"32","author":"PD Gr\u00fcnwald","year":"2004","unstructured":"Gr\u00fcnwald, P.D., Dawid, A.P.: Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory. Ann. Stat. 32(4), 1367\u20131433 (2004). https:\/\/doi.org\/10.1214\/009053604000000553","journal-title":"Ann. Stat."},{"issue":"1","key":"2150_CR14","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10107-018-1307-z","volume":"174","author":"S Guo","year":"2019","unstructured":"Guo, S., Xu, H.: Distributionally robust shortfall risk optimization model and its approximation. Math. Program. 174(1), 473\u2013498 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1307-z","journal-title":"Math. Program."},{"key":"2150_CR15","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2023.3300890","author":"L He","year":"2023","unstructured":"He, L., Zhang, H.: Large-scale graph Sinkhorn distance approximation for resource-constrained devices. IEEE Trans. Consum. Electron. (2023). https:\/\/doi.org\/10.1109\/TCE.2023.3300890","journal-title":"IEEE Trans. Consum. Electron."},{"key":"2150_CR16","volume-title":"Fundamentals of Convex Analysis","author":"J-B Hiriart-Urruty","year":"2004","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer, Dordrecht (2004)"},{"issue":"1","key":"2150_CR17","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10107-010-0428-9","volume":"133","author":"J Hu","year":"2012","unstructured":"Hu, J., Homem-de-Mello, T., Mehrotra, S.: Sample average approximation of stochastic dominance constrained programs. Math. Program. 133(1), 171\u2013201 (2012). https:\/\/doi.org\/10.1007\/s10107-010-0428-9","journal-title":"Math. Program."},{"key":"2150_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (2011)"},{"issue":"7","key":"2150_CR19","first-page":"52","volume":"13","author":"LV Kantorovich","year":"1958","unstructured":"Kantorovich, L.V., Rubinshte\u01d0n, G.S.: On a space of completely additive functions. Vestn. Leningr.Univ. 13(7), 52\u201359 (1958)","journal-title":"Vestn. Leningr.Univ."},{"doi-asserted-by":"publisher","unstructured":"Kuhn, D., Esfahani, P.M., Nguyen, V.A., Shafieezadeh-Abadeh, S.: Wasserstein distributionally robust optimization: Theory and applications in machine learning, pp. 130\u2013166. INFORMS, Washington (2019)https:\/\/doi.org\/10.1287\/educ.2019.0198","key":"2150_CR20","DOI":"10.1287\/educ.2019.0198"},{"issue":"1","key":"2150_CR21","doi-asserted-by":"publisher","first-page":"159","DOI":"10.3934\/naco.2021057","volume":"12","author":"F Lin","year":"2022","unstructured":"Lin, F., Fang, X., Gao, Z.: Distributionally robust optimization: a review on theory and applications. Numer. Ger. Control and Optim 12(1), 159\u2013212 (2022). https:\/\/doi.org\/10.3934\/naco.2021057","journal-title":"Numer. Ger. Control and Optim"},{"unstructured":"Lin, T., Fan, C., Ho, N., Cuturi, M., Jordan, M.I.: Projection robust Wasserstein distance and Riemannian optimization. In: Proceedings of the 34th International Conference on Neural Information Processing Systems. NIPS\u201920, pp. 9383\u20139397. Curran Associates Inc., Vancouver, BC, Canada (2020)","key":"2150_CR22"},{"key":"2150_CR23","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3262351","author":"Y Liu","year":"2023","unstructured":"Liu, Y., Zhu, L., Wang, X., Yamada, M., Yang, Y.: Bilaterally normalized scale-consistent Sinkhorn distance for few-shot image classification. IEEE Trans. Neural Netw. Learn. Syst. (2023). https:\/\/doi.org\/10.1109\/TNNLS.2023.3262351","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"2150_CR24","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.2021.2238","volume":"71","author":"DZ Long","year":"2023","unstructured":"Long, D.Z., Sim, M., Zhou, M.: Robust satisficing. Oper. Res. 71(1), 61\u201382 (2023). https:\/\/doi.org\/10.1287\/opre.2021.2238","journal-title":"Oper. Res."},{"issue":"8","key":"2150_CR25","doi-asserted-by":"publisher","first-page":"2565","DOI":"10.1007\/s11590-020-01574-3","volume":"14","author":"F Luo","year":"2020","unstructured":"Luo, F., Mehrotra, S.: Distributionally robust optimization with decision dependent ambiguity sets. Optim. Lett. 14(8), 2565\u20132594 (2020)","journal-title":"Optim. Lett."},{"key":"2150_CR26","volume-title":"Information Theory. Inference & Learning Algorithms","author":"DJC MacKay","year":"2003","unstructured":"MacKay, D.J.C.: Information Theory. Inference & Learning Algorithms. Cambridge University Press, USA (2003)"},{"key":"2150_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46214-0","volume-title":"Stochastic optimization methods: applications in engineering and operations research","author":"K Marti","year":"2015","unstructured":"Marti, K.: Stochastic optimization methods: applications in engineering and operations research. Springer, Berlin (2015)"},{"issue":"1","key":"2150_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-017-1172-1","volume":"171","author":"P Mohajerin Esfahani","year":"2018","unstructured":"Mohajerin Esfahani, P., Kuhn, D.: Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations. Math. Program. 171(1), 115\u2013166 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1172-1","journal-title":"Math. Program."},{"issue":"5\u20136","key":"2150_CR29","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"II","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9, G., Cuturi, M.: Computational optimal transport: with application to data science. Found. Trends Mach. Learn. II(5\u20136), 355\u2013607 (2019)","journal-title":"Found. Trends Mach. Learn."},{"issue":"4","key":"2150_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5802\/ojmo.15","volume":"3","author":"H Rahimian","year":"2022","unstructured":"Rahimian, H., Mehrotra, S.: Frameworks and results in distributionally robust optimization. Open J. Math. Optim. 3(4), 1\u201385 (2022). https:\/\/doi.org\/10.5802\/ojmo.15","journal-title":"Open J. Math. Optim."},{"doi-asserted-by":"publisher","unstructured":"Ramachandra, A., Rujeerapaiboon, N., Sim, M.: Robust conic satisficing (2022). https:\/\/doi.org\/10.48550\/arXiv.2107.06714","key":"2150_CR31","DOI":"10.48550\/arXiv.2107.06714"},{"issue":"2","key":"2150_CR32","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2150_CR33","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1111\/j.1468-5914.2010.00450.x","volume":"41","author":"B Schwartz","year":"2011","unstructured":"Schwartz, B., Ben-Haim, Y., Dacso, C.: What makes a good decision? Robust satisficing as a normative standard of rational decision making. J. Theory Soc. Behav. 41(2), 209\u2013227 (2011). https:\/\/doi.org\/10.1111\/j.1468-5914.2010.00450.x","journal-title":"J. Theory Soc. Behav."},{"key":"2150_CR34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976595","volume-title":"Lectures on stochastic programming: modeling and theory","author":"A Shapiro","year":"2021","unstructured":"Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on stochastic programming: modeling and theory. Society for Industrial and Applied Mathematics, Philadelphia (2021)"},{"key":"2150_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-349-00210-8_1","volume-title":"Theories of decision-making in economics and behavioural science","author":"HA Simon","year":"1966","unstructured":"Simon, H.A.: Theories of decision-making in economics and behavioural science, pp. 1\u201328. Palgrave Macmillan UK, London (1966). https:\/\/doi.org\/10.1007\/978-1-349-00210-8_1"},{"issue":"3","key":"2150_CR36","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/mnsc.1050.0451","volume":"52","author":"JE Smith","year":"2006","unstructured":"Smith, J.E., Winkler, R.L.: The optimizer\u2019s curse: skepticism and postdecision surprise in decision analysis. Manage. Sci. 52(3), 311\u2013322 (2006). https:\/\/doi.org\/10.1287\/mnsc.1050.0451","journal-title":"Manage. Sci."},{"issue":"03","key":"2150_CR37","doi-asserted-by":"publisher","first-page":"1340002","DOI":"10.1142\/S0217595913400022","volume":"30","author":"H Sun","year":"2013","unstructured":"Sun, H., Xu, H., Wang, Y.: A smoothing penalized sample average approximation method for stochastic programs with second-order stochastic dominance constraints. Asia-Pacific J. Oper. Res. 30(03), 1340002\u201325 (2013). https:\/\/doi.org\/10.1142\/S0217595913400022","journal-title":"Asia-Pacific J. Oper. Res."},{"doi-asserted-by":"publisher","unstructured":"Vidyashankar, A.N., Xu, J.: Stochastic optimization using Hellinger distance. In: Proceedings of the 2015 Winter Simulation Conference. WSC \u201915, pp. 3702\u20133713. IEEE Press, Huntington Beach, California (2015). https:\/\/doi.org\/10.1109\/WSC.2015.7408528","key":"2150_CR38","DOI":"10.1109\/WSC.2015.7408528"},{"doi-asserted-by":"publisher","unstructured":"Wang, J., Gao, R., Xie, Y.: Two-sample test using projected Wasserstein distance. In: 2021 IEEE International Symposium on Information Theory (ISIT), pp. 3320\u20133325 (2021). https:\/\/doi.org\/10.1109\/ISIT45174.2021.9518186","key":"2150_CR39","DOI":"10.1109\/ISIT45174.2021.9518186"},{"doi-asserted-by":"publisher","unstructured":"Wang, J., Gao, R., Xie, Y.: Sinkhorn distributionally robust optimization. arXiv preprint, 1\u201358 (2022) https:\/\/doi.org\/10.48550\/arXiv.2109.11926[math.OC]","key":"2150_CR40","DOI":"10.48550\/arXiv.2109.11926"},{"issue":"7","key":"2150_CR41","doi-asserted-by":"publisher","first-page":"1839","DOI":"10.1080\/02331934.2022.2048382","volume":"72","author":"S Wang","year":"2023","unstructured":"Wang, S., Pang, L., Guo, H., Zhang, H.: Distributionally robust optimization with multivariate second-order stochastic dominance constraints with applications in portfolio optimization. Optimization 72(7), 1839\u20131862 (2023). https:\/\/doi.org\/10.1080\/02331934.2022.2048382","journal-title":"Optimization"},{"issue":"2","key":"2150_CR42","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1016\/j.ejor.2018.08.037","volume":"273","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Zhang, Y., Tang, J.: A distributionally robust optimization approach for surgery block allocation. Eur. J. Oper. Res. 273(2), 740\u2013753 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.08.037","journal-title":"Eur. J. Oper. Res."},{"key":"2150_CR43","doi-asserted-by":"publisher","DOI":"10.1111\/poms.13799","author":"M Zhou","year":"2022","unstructured":"Zhou, M., Sim, M., Lam, S.-W.L.: Advance admission scheduling via resource satisficing. Prod. Operat. Manag. (2022). https:\/\/doi.org\/10.1111\/poms.13799","journal-title":"Prod. Operat. Manag."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02150-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02150-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02150-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T16:25:14Z","timestamp":1742055914000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02150-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,27]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2150"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02150-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2024,9,27]]},"assertion":[{"value":"22 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2024","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 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"}}]}}