{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T01:25:07Z","timestamp":1773710707529,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T00:00:00Z","timestamp":1749600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T00:00:00Z","timestamp":1749600000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","award":["543963649"],"award-info":[{"award-number":["543963649"]}],"id":[{"id":"10.13039\/501100001659","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":[[2025,9]]},"DOI":"10.1007\/s10957-025-02744-y","type":"journal-article","created":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T11:18:46Z","timestamp":1749640726000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Inexact Halpern Iteration with Application to Distributionally Robust Optimization"],"prefix":"10.1007","volume":"206","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0671-9561","authenticated-orcid":false,"given":"Ling","family":"Liang","sequence":"first","affiliation":[]},{"given":"Zusen","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Kim-Chuan","family":"Toh","sequence":"additional","affiliation":[]},{"given":"Jia-Jie","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,11]]},"reference":[{"key":"2744_CR1","unstructured":"Alacaoglu, A., Kim, D., Wright, S.J.: Extending the reach of first-order algorithms for nonconvex min-max problems with cohypomonotonicity. arXiv preprint arXiv:2402.05071 (2024)"},{"key":"2744_CR2","unstructured":"Alacaoglu, A., Kim, D., Wright, S.J.: Revisiting inexact fixed-point iterations for min-max problems: Stochasticity and structured nonconvexity. arXiv preprint arXiv:2402.05071 (2024)"},{"key":"2744_CR3","unstructured":"Bauschke, H.H.: Projection Algorithms and Monotone Operators. Ph.D. thesis, Simon Fraser University, Canada (1996)"},{"key":"2744_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-319-48311-5","journal-title":"Springer"},{"key":"2744_CR5","doi-asserted-by":"publisher","unstructured":"Blanchet, J., Kang, Y.: Semi-supervised learning based on distributionally robust optimization. In: Data Analysis and Applications 3: Computational, Classification, Financial, Statistical and Stochastic Methods, pp. 1\u201333 (2020). https:\/\/doi.org\/10.1002\/9781119721871.ch1","DOI":"10.1002\/9781119721871.ch1"},{"key":"2744_CR6","unstructured":"Blanchet, J., Li, J., Lin, S., Zhang, X.: Distributionally robust optimization and robust statistics. arXiv preprint arXiv:2401.14655 (2024)"},{"issue":"2","key":"2744_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). https:\/\/doi.org\/10.1287\/moor.2018.0936","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2744_CR8","doi-asserted-by":"publisher","first-page":"1500","DOI":"10.1287\/moor.2021.1178","volume":"47","author":"J Blanchet","year":"2022","unstructured":"Blanchet, J., Murthy, K., Zhang, F.: Optimal transport-based distributionally robust optimization: Structural properties and iterative schemes. Math. Oper. Res. 47(2), 1500\u20131529 (2022). https:\/\/doi.org\/10.1287\/moor.2021.1178","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2744_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018). https:\/\/doi.org\/10.1137\/16M1080173","journal-title":"SIAM Rev."},{"key":"2744_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004). https:\/\/doi.org\/10.1017\/CBO9780511804441","journal-title":"Convex Optimization. Cambridge University Press"},{"key":"2744_CR11","unstructured":"Cai, X., Song, C., Guzm\u00e1n, C., Diakonikolas, J.: Stochastic Halpern iteration with variance reduction for stochastic monotone inclusions. In: Proceedings of the 36th International Conference on Neural Information Processing Systems, NIPS \u201922. Curran Associates Inc., Red Hook, NY, USA (2022)"},{"issue":"4","key":"2744_CR12","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/j.camwa.2011.12.074","volume":"64","author":"LC Ceng","year":"2012","unstructured":"Ceng, L.C., Ansari, Q.H., Yao, J.C.: An extragradient method for solving split feasibility and fixed point problems. Comput. Math. Appl. 64(4), 633\u2013642 (2012). https:\/\/doi.org\/10.1016\/j.camwa.2011.12.074","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"2744_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s11228-020-00542-4","volume":"29","author":"V Cevher","year":"2021","unstructured":"Cevher, V., V\u0169, B.C.: A reflected forward-backward splitting method for monotone inclusions involving Lipschitzian operators. Set-Valued Var. Anal. 29(1), 163\u2013174 (2021). https:\/\/doi.org\/10.1007\/s11228-020-00542-4","journal-title":"Set-Valued Var. Anal."},{"key":"2744_CR14","doi-asserted-by":"crossref","unstructured":"Cheney, W., Goldstein, A.A.: Proximity maps for convex sets. Proc. Am. Math. Soc. 10(3), 448\u2013450 (1959). http:\/\/www.jstor.org\/stable\/2032864","DOI":"10.1090\/S0002-9939-1959-0105008-8"},{"issue":"4","key":"2744_CR15","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005). https:\/\/doi.org\/10.1137\/050626090","journal-title":"Multiscale Model. Simul."},{"key":"2744_CR16","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-018-1300-6","volume":"178","author":"Y Cui","year":"2019","unstructured":"Cui, Y., Sun, D., Toh, K.C.: On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming. Math. Program. 178, 381\u2013415 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1300-6","journal-title":"Math. Program."},{"key":"2744_CR17","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s11228-017-0421-z","volume":"25","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications. Set-Valued Var. Anal. 25, 829\u2013858 (2017). https:\/\/doi.org\/10.1007\/s11228-017-0421-z","journal-title":"Set-Valued Var. Anal."},{"issue":"3","key":"2744_CR18","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). https:\/\/doi.org\/10.1287\/opre.1090.0741","journal-title":"Oper. Res."},{"key":"2744_CR19","unstructured":"Diakonikolas, J.: Halpern iteration for near-optimal and parameter-free monotone inclusion and strong solutions to variational inequalities. In: J.\u00a0Abernethy, S.\u00a0Agarwal (eds.) 33rd Annual Conference on Learning Theory, Proceedings of Machine Learning Research, vol. 125, pp. 1428\u20131451. PMLR (2020)"},{"issue":"3","key":"2744_CR20","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1137\/21M1395302","volume":"32","author":"J Diakonikolas","year":"2022","unstructured":"Diakonikolas, J., Wang, P.: Potential function-based framework for minimizing gradients in convex and min-max optimization. SIAM J. Optim. 32(3), 1668\u20131697 (2022). https:\/\/doi.org\/10.1137\/21M1395302","journal-title":"SIAM J. Optim."},{"key":"2744_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/b97543","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer (2003). https:\/\/doi.org\/10.1007\/b97543","journal-title":"Springer"},{"issue":"2","key":"2744_CR22","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). https:\/\/doi.org\/10.1287\/moor.2022.1275","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2744_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math. Program. 155(1), 267\u2013305 (2016). https:\/\/doi.org\/10.1007\/s10107-014-0846-1","journal-title":"Math. Program."},{"key":"2744_CR24","unstructured":"Gower, R.M., Loizou, N., Qian, X., Sailanbayev, A., Shulgin, E., Richt\u00e1rik, P.: SGD: General analysis and improved rates. In: International Conference on Machine Learning, pp. 5200\u20135209. PMLR (2019)"},{"key":"2744_CR25","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1090\/S0002-9904-1967-11864-0","volume":"73","author":"B Halpern","year":"1967","unstructured":"Halpern, B.: Fixed points of nonexpanding maps. Bull. Am. Math. Soc. 73, 957\u2013961 (1967). https:\/\/doi.org\/10.1090\/S0002-9904-1967-11864-0","journal-title":"Bull. Am. Math. Soc."},{"issue":"12","key":"2744_CR26","doi-asserted-by":"publisher","first-page":"e2082","DOI":"10.1016\/j.na.2009.03.064","volume":"71","author":"S Iemoto","year":"2009","unstructured":"Iemoto, S., Takahashi, W.: Approximating common fixed points of nonexpansive mappings and nonspreading mappings in a Hilbert space. Nonlinear Anal. Theory Methods Appl. 71(12), e2082\u2013e2089 (2009). https:\/\/doi.org\/10.1016\/j.na.2009.03.064","journal-title":"Nonlinear Anal. Theory Methods Appl."},{"key":"2744_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39568-1","author":"G Lan","year":"2020","unstructured":"Lan, G.: First-order and Stochastic Optimization Methods for Machine Learning. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-39568-1","journal-title":"Springer"},{"key":"2744_CR28","unstructured":"Lee, C., Mehrotra, S.: A distributionally-robust approach for finding support vector machines. Available from Optimization Online (2015). https:\/\/optimization-online.org\/?p=13477"},{"issue":"11","key":"2744_CR29","doi-asserted-by":"publisher","first-page":"1680","DOI":"10.3217\/jucs-013-11-1680","volume":"13","author":"L Leustean","year":"2007","unstructured":"Leustean, L.: Rates of asymptotic regularity for Halpern iterations of nonexpansive mappings. J. Uni. Comput. Sci. 13(11), 1680\u20131691 (2007). https:\/\/doi.org\/10.3217\/jucs-013-11-1680","journal-title":"J. Uni. Comput. Sci."},{"key":"2744_CR30","unstructured":"Li, J., Chen, C., So, A.M.C.: Fast epigraphical projection-based incremental algorithms for Wasserstein distributionally robust support vector machine. In: Proceedings of the 34rd International Conference on Neural Information Processing Systems. Curran Associates Inc., Red Hook, NY, USA (2020)"},{"key":"2744_CR31","unstructured":"Li, J., Huang, S., So, A.M.C.: A first-order algorithmic framework for Wasserstein distributionally robust logistic regression. In: Proceedings of the 33rd International Conference on Neural Information Processing Systems. Curran Associates Inc., Red Hook, NY, USA (2019)"},{"key":"2744_CR32","unstructured":"Li, Z., Bao, H., Zhang, X., Richt\u00e1rik, P.: PAGE: A simple and optimal probabilistic gradient estimator for nonconvex optimization. In: International Conference on Machine Learning, pp. 6286\u20136295. PMLR (2021)"},{"issue":"3","key":"2744_CR33","doi-asserted-by":"publisher","first-page":"1748","DOI":"10.1137\/20M1374262","volume":"31","author":"L Liang","year":"2021","unstructured":"Liang, L., Sun, D., Toh, K.C.: An inexact augmented Lagrangian method for second-order cone programming with applications. SIAM J. Optim. 31(3), 1748\u20131773 (2021). https:\/\/doi.org\/10.1137\/20M1374262","journal-title":"SIAM J. Optim."},{"key":"2744_CR34","unstructured":"Liang, L., Toh, K.C., Yang, H.: Vertex exchange method for a class of quadratic programming problems. arXiv preprint arXiv:2407.03294 (2024)"},{"issue":"2","key":"2744_CR35","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s11590-020-01617-9","volume":"15","author":"F Lieder","year":"2021","unstructured":"Lieder, F.: On the convergence rate of the Halpern-iteration. Optim. Lett. 15(2), 405\u2013418 (2021). https:\/\/doi.org\/10.1007\/s11590-020-01617-9","journal-title":"Optim. Lett."},{"issue":"6","key":"2744_CR36","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6), 964\u2013979 (1979). https:\/\/doi.org\/10.1137\/0716071","journal-title":"SIAM J. Numer. Anal."},{"key":"2744_CR37","unstructured":"Loizou, N., Berard, H., Gidel, G., Mitliagkas, I., Lacoste-Julien, S.: Stochastic gradient descent-ascent and consensus optimization for smooth games: convergence analysis under expected co-coercivity. In: Proceedings of the 35th International Conference on Neural Information Processing Systems, NIPS \u201921. Curran Associates Inc., Red Hook, NY, USA (2021)"},{"issue":"1","key":"2744_CR38","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ejor.2019.03.008","volume":"278","author":"F Luo","year":"2019","unstructured":"Luo, F., Mehrotra, S.: Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models. Eur. J. Oper. Res. 278(1), 20\u201335 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2019.03.008","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2744_CR39","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0322019","volume":"22","author":"FJ Luque","year":"1984","unstructured":"Luque, F.J.: Asymptotic convergence analysis of the proximal point algorithm. SIAM J. Control. Optim. 22(2), 277\u2013293 (1984). https:\/\/doi.org\/10.1137\/0322019","journal-title":"SIAM J. Control. Optim."},{"key":"2744_CR40","unstructured":"Maing\u00e9, P.E.: Fast convergence of generalized forward-backward algorithms for structured monotone inclusions. arXiv preprint arXiv:2107.10107 (2021)"},{"issue":"1","key":"2744_CR41","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/14097238X","volume":"25","author":"Y Malitsky","year":"2015","unstructured":"Malitsky, Y.: Projected reflected gradient methods for monotone variational inequalities. SIAM J. Optim. 25(1), 502\u2013520 (2015). https:\/\/doi.org\/10.1137\/14097238X","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2744_CR42","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1137\/18M1207260","volume":"30","author":"Y Malitsky","year":"2020","unstructured":"Malitsky, Y., Tam, M.K.: A forward-backward splitting method for monotone inclusions without cocoercivity. SIAM J. Optim. 30(2), 1451\u20131472 (2020). https:\/\/doi.org\/10.1137\/18M1207260","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2744_CR43","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."},{"key":"2744_CR44","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence $${O}(1\/k^2)$$. Dokl. Akad. Nauk SSSR 269, 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"5","key":"2744_CR45","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/BF01141092","volume":"28","author":"LD Popov","year":"1980","unstructured":"Popov, L.D.: A modification of the Arrow-Hurwitz method of search for saddle points. Mat. Zametki 28(5), 777\u2013784 (1980). https:\/\/doi.org\/10.1007\/BF01141092","journal-title":"Mat. Zametki"},{"key":"2744_CR46","unstructured":"Rahimian, H., Mehrotra, S.: Distributionally robust optimization: A review. arXiv preprint arXiv:1908.05659 (2019)"},{"key":"2744_CR47","doi-asserted-by":"publisher","unstructured":"Rahimian, H., Mehrotra, S.: Frameworks and results in distributionally robust optimization. Open J. Math. Optim. 3, 4 (2022). https:\/\/doi.org\/10.5802\/ojmo.15\/","DOI":"10.5802\/ojmo.15\/"},{"key":"2744_CR48","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"issue":"5","key":"2744_CR49","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control. Optim. 14(5), 877\u2013898 (1976). https:\/\/doi.org\/10.1137\/0314056","journal-title":"SIAM J. Control. Optim."},{"key":"2744_CR50","doi-asserted-by":"publisher","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer Berlin, Heidelberg (1998). https:\/\/doi.org\/10.1007\/978-3-642-02431-3","DOI":"10.1007\/978-3-642-02431-3"},{"key":"2744_CR51","unstructured":"Shafieezadeh-Abadeh, S., Esfahani, P.M., Kuhn, D.: Distributionally robust logistic regression. In: Proceedings of the 29th International Conference on Neural Information Processing Systems - Volume 1, NIPS\u201915, p. 1576\u20131584. MIT Press, Cambridge, MA, USA (2015)"},{"key":"2744_CR52","unstructured":"Shafieezadeh-Abadeh, S., Nguyen, V.A., Kuhn, D., Esfahani, P.M.: Wasserstein distributionally robust kalman filtering. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, NIPS\u201918, p. 8483\u20138492. Curran Associates Inc., Red Hook, NY, USA (2018)"},{"key":"2744_CR53","unstructured":"Szegedy, C., Zaremba, W., Sutskever, I., Bruna, J., Erhan, D., Goodfellow, I., Fergus, R.: Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199 (2013)"},{"issue":"1","key":"2744_CR54","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1007\/s10107-022-01856-x","volume":"199","author":"B Ta\u015fkesen","year":"2023","unstructured":"Ta\u015fkesen, B., Shafieezadeh-Abadeh, S., Kuhn, D.: Semi-discrete optimal transport: Hardness, regularization and numerical solution. Math. Program. 199(1), 1033\u20131106 (2023). https:\/\/doi.org\/10.1007\/s10107-022-01856-x","journal-title":"Math. Program."},{"issue":"1","key":"2744_CR55","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10589-023-00518-8","volume":"87","author":"Q Tran-Dinh","year":"2024","unstructured":"Tran-Dinh, Q.: From Halpern\u2019s fixed-point iterations to Nesterov\u2019s accelerated interpretations for root-finding problems. Comput. Optim. Appl. 87(1), 181\u2013218 (2024). https:\/\/doi.org\/10.1007\/s10589-023-00518-8","journal-title":"Comput. Optim. Appl."},{"key":"2744_CR56","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2024.0414","author":"Q Tran-Dinh","year":"2025","unstructured":"Tran-Dinh, Q., Luo, Y.: Randomized block-coordinate optimistic gradient algorithms for root-finding problems. Math. Oper. Res. (2025). https:\/\/doi.org\/10.1287\/moor.2024.0414","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2744_CR57","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0363012998338806","volume":"38","author":"P Tseng","year":"2000","unstructured":"Tseng, P.: A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control. Optim. 38(2), 431\u2013446 (2000). https:\/\/doi.org\/10.1137\/S0363012998338806","journal-title":"SIAM J. Control. Optim."},{"key":"2744_CR58","unstructured":"Vapnik, V.: Principles of risk minimization for learning theory. In: Proceedings of the 5th International Conference on Neural Information Processing Systems, NIPS\u201991, p. 831\u2013838. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1991)"},{"issue":"1","key":"2744_CR59","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006). https:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."},{"issue":"5","key":"2744_CR60","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/BF01190119","volume":"58","author":"R Wittmann","year":"1992","unstructured":"Wittmann, R.: Approximation of fixed points of nonexpansive mappings. Arch. Math. 58(5), 486\u2013491 (1992). https:\/\/doi.org\/10.1007\/BF01190119","journal-title":"Arch. Math."},{"issue":"3","key":"2744_CR61","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10915-024-02549-7","volume":"99","author":"L Yang","year":"2024","unstructured":"Yang, L., Liang, L., Chu, H.T.M., Toh, K.C.: A corrected inexact proximal augmented Lagrangian method with a relative error criterion for a class of group-quadratic regularized optimal transport problems. J. Sci. Comput. 99(3), 79 (2024). https:\/\/doi.org\/10.1007\/s10915-024-02549-7","journal-title":"J. Sci. Comput."},{"key":"2744_CR62","unstructured":"Yoon, T., Ryu, E.K.: Accelerated algorithms for smooth convex-concave minimax problems with $${O}(1\/k^2)$$ rate on squared gradient norm. In: M.\u00a0Meila, T.\u00a0Zhang (eds.) Proceedings of the 38th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol. 139, pp. 12,098\u201312,109. PMLR (2021)"},{"key":"2744_CR63","unstructured":"Yu, Y., Lin, T., Mazumdar, E.V., Jordan, M.: Fast distributionally robust learning with variance-reduced min-max optimization. In: International Conference on Artificial Intelligence and Statistics, pp. 1219\u20131250. PMLR (2022)"},{"key":"2744_CR64","unstructured":"Zhang, G., Yuan, Y., Sun, D.: An efficient HPR algorithm for the Wasserstein barycenter problem with $$ \\rm {O}(dim (p) \/ \\varepsilon ) $$ computational complexity. arXiv preprint arXiv:2211.14881 (2022)"},{"issue":"2","key":"2744_CR65","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.orl.2018.01.011","volume":"46","author":"C Zhao","year":"2018","unstructured":"Zhao, C., Guan, Y.: Data-driven risk-averse stochastic optimization with Wasserstein metric. Oper. Res. Lett. 46(2), 262\u2013267 (2018). https:\/\/doi.org\/10.1016\/j.orl.2018.01.011","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"2744_CR66","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"XY Zhao","year":"2010","unstructured":"Zhao, X.Y., Sun, D., Toh, K.C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010). https:\/\/doi.org\/10.1137\/080718206","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02744-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02744-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02744-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,18]],"date-time":"2025-07-18T08:56:12Z","timestamp":1752828972000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02744-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,11]]},"references-count":66,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["2744"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02744-y","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,11]]},"assertion":[{"value":"22 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"58"}}