{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T20:41:10Z","timestamp":1770756070476,"version":"3.50.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:00:00Z","timestamp":1737590400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:00:00Z","timestamp":1737590400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12331010; 12288101; 2024YFA1012903"],"award-info":[{"award-number":["12331010; 12288101; 2024YFA1012903"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10915-025-02794-4","type":"journal-article","created":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T14:03:33Z","timestamp":1737641013000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Augmented Lagrangian Primal-Dual Semismooth Newton Method for Multi-Block Composite Optimization"],"prefix":"10.1007","volume":"102","author":[{"given":"Zhanwang","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kangkang","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zaiwen","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,23]]},"reference":[{"key":"2794_CR1","unstructured":"Albertina, B.,\u00a0Watson, M.,\u00a0Holback, C.,\u00a0Jarosz, R.,\u00a0Kirk, S.,\u00a0Lee, Y.,\u00a0Rieger-Christ, K., Lemmerman, J.: The cancer genome atlas lung adenocarcinoma collection (TCGA-LUAD) (Version 4). In: The Cancer Imaging Archive (2006)"},{"issue":"1","key":"2794_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10107-022-01873-w","volume":"200","author":"G Bareilles","year":"2023","unstructured":"Bareilles, G., Iutzeler, F., Malick, J.: Newton acceleration on manifolds identified by proximal gradient methods. Math. Program. 200(1), 37\u201370 (2023)","journal-title":"Math. Program."},{"key":"2794_CR3","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-order methods in optimization. SIAM (2017)","DOI":"10.1137\/1.9781611974997"},{"key":"2794_CR4","first-page":"9264","volume":"34","author":"T Boschi","year":"2021","unstructured":"Boschi, T., Reimherr, M., Chiaromonte, F.: A highly-efficient group elastic net algorithm with an application to function-on-scalar regression. Adv. Neural. Inf. Process. Syst. 34, 9264\u20139277 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2794_CR5","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J., et\u00a0al.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends\u00ae Mach. Learn. 3(1), 1\u2013122 (2011)"},{"issue":"1","key":"2794_CR6","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2010","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2010)","journal-title":"J. Math. Imaging Vis."},{"issue":"1","key":"2794_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10107-016-1007-5","volume":"161","author":"L Chen","year":"2017","unstructured":"Chen, L., Sun, D., Toh, K.-C.: An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming. Math. Program. 161(1), 237\u2013270 (2017)","journal-title":"Math. Program."},{"key":"2794_CR8","first-page":"2016","volume":"1\u201318","author":"P Chen","year":"2016","unstructured":"Chen, P., Huang, J., Zhang, X.: A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions. Fixed Point Theory Appl. 1\u201318, 2016 (2016)","journal-title":"Fixed Point Theory Appl."},{"key":"2794_CR9","doi-asserted-by":"crossref","unstructured":"Chen, S., Ma, S., Man-Cho So, A., Zhang, T.: Proximal gradient method for nonsmooth optimization over the Stiefel manifold. SIAM J. Optim. (2020)","DOI":"10.1137\/18M122457X"},{"key":"2794_CR10","doi-asserted-by":"crossref","unstructured":"Chen, S., Ma, S., Xue, L., Zou, H.: An alternating manifold proximal gradient method for sparse principal component analysis and sparse canonical correlation analysis. INFORMS J. Optim. (2020)","DOI":"10.32614\/CRAN.package.amanpg"},{"issue":"1","key":"2794_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/22M1490223","volume":"16","author":"E Chouzenoux","year":"2023","unstructured":"Chouzenoux, E., Contreras, A., Pesquet, J.-C., Savanier, M.: Convergence results for primal-dual algorithms in the presence of adjoint mismatch. SIAM J. Imag. Sci. 16(1), 1\u201334 (2023)","journal-title":"SIAM J. Imag. Sci."},{"key":"2794_CR12","doi-asserted-by":"crossref","unstructured":"Clarke, F.H.: Optimization and nonsmooth analysis. SIAM (1990)","DOI":"10.1137\/1.9781611971309"},{"issue":"2","key":"2794_CR13","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/s10957-012-0245-9","volume":"158","author":"L Condat","year":"2013","unstructured":"Condat, L.: A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms. J. Optim. Theory Appl. 158(2), 460\u2013479 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"2794_CR14","doi-asserted-by":"crossref","unstructured":"Davis, D., Yin, W.: Convergence rate analysis of several splitting schemes. Splitting Methods in Communication, Imaging, Science, and Engineering, p. 115 (2017)","DOI":"10.1007\/978-3-319-41589-5_4"},{"issue":"4","key":"2794_CR15","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1137\/21M1398513","volume":"14","author":"W Diepeveen","year":"2021","unstructured":"Diepeveen, W., Lellmann, J.: An inexact semismooth Newton method on Riemannian manifolds with application to duality-based total variation denoising. SIAM J. Imag. Sci. 14(4), 1565\u20131600 (2021)","journal-title":"SIAM J. Imag. Sci."},{"issue":"2","key":"2794_CR16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.orl.2015.02.001","volume":"43","author":"Y Drori","year":"2015","unstructured":"Drori, Y., Sabach, S., Teboulle, M.: A simple algorithm for a class of nonsmooth convex-concave saddle-point problems. Oper. Res. Lett. 43(2), 209\u2013214 (2015)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132","key":"2794_CR17","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10107-013-0730-4","volume":"147","author":"D Drusvyatskiy","year":"2014","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Optimality, identifiability, and sensitivity. Math. Program. 147(1\u20132), 467\u2013498 (2014)","journal-title":"Math. Program."},{"issue":"4","key":"2794_CR18","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1137\/09076934X","volume":"3","author":"E Esser","year":"2010","unstructured":"Esser, E., Zhang, X., Chan, T.F.: A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science. SIAM J. Imaging Sci. 3(4), 1015\u20131046 (2010)","journal-title":"SIAM J. Imaging Sci."},{"key":"2794_CR19","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, New York (2003)"},{"issue":"4","key":"2794_CR20","first-page":"1223","volume":"4","author":"J Fan","year":"2004","unstructured":"Fan, J., Pan, J.: Inexact Levenberg\u2013Marquardt method for nonlinear equations. Discrete Continu. Dyn. Syst.-B 4(4), 1223\u20131232 (2004)","journal-title":"Discrete Continu. Dyn. Syst.-B"},{"key":"2794_CR21","volume-title":"Semismooth Newton Methods and Applications","author":"M Hinterm\u00fcller","year":"2010","unstructured":"Hinterm\u00fcller, M.: Semismooth Newton Methods and Applications. Humboldt-University of Berlin, Department of Mathematics (2010)"},{"key":"2794_CR22","doi-asserted-by":"crossref","unstructured":"Hu, H., Li, X., Im, H., Wolkowicz, H.: A semismooth Newton-type method for the nearest doubly stochastic matrix problem. Math. Oper. Res. (2023)","DOI":"10.1287\/moor.2023.1382"},{"key":"2794_CR23","unstructured":"Hu, J., Tian, T., Pan, S., Wen, Z.: On the local convergence of the semismooth Newton method for composite optimization (2022). arXiv preprint arXiv:2211.01127"},{"issue":"1","key":"2794_CR24","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1006\/jmaa.1995.1412","volume":"196","author":"HY Jiang","year":"1995","unstructured":"Jiang, H.Y., Qi, L.Q.: Local uniqueness and convergence of iterative methods for nonsmooth variational inequalities. J. Math. Anal. Appl. 196(1), 314\u2013331 (1995)","journal-title":"J. Math. Anal. Appl."},{"key":"2794_CR25","unstructured":"Karush, W.: Minima of functions of several variables with inequalities as side constraints. M. Sc. Dissertation. Dept. of Mathematics, Univ. of Chicago (1939)"},{"issue":"3","key":"2794_CR26","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"ME Kilmer","year":"2011","unstructured":"Kilmer, M.E., Martin, C.D.: Factorization strategies for third-order tensors. Linear Algebra Appl. 435(3), 641\u2013658 (2011)","journal-title":"Linear Algebra Appl."},{"issue":"6","key":"2794_CR27","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/MSP.2014.2377273","volume":"32","author":"N Komodakis","year":"2015","unstructured":"Komodakis, N., Pesquet, J.-C.: Playing with duality: an overview of recent primal-dual approaches for solving large-scale optimization problems. IEEE Signal Process. Mag. 32(6), 31\u201354 (2015)","journal-title":"IEEE Signal Process. Mag."},{"key":"2794_CR28","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W., Tucker, A.W.: Nonlinear programming. In: Traces and Emergence of Nonlinear Programming, pp. 247\u2013258. Springer (2014)","DOI":"10.1007\/978-3-0348-0439-4_11"},{"issue":"3","key":"2794_CR29","first-page":"254","volume":"3","author":"X-Y Lam","year":"2021","unstructured":"Lam, X.-Y., Sun, D., Toh, K.-C.: Semi-proximal augmented Lagrangian-based decomposition methods for primal block-angular convex composite quadratic conic programming problems. Inf. J. Optim. 3(3), 254\u2013277 (2021)","journal-title":"Inf. J. Optim."},{"issue":"3","key":"2794_CR30","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S1052623401387623","volume":"13","author":"AS Lewis","year":"2002","unstructured":"Lewis, A.S.: Active sets, nonsmoothness, and sensitivity. SIAM J. Optim. 13(3), 702\u2013725 (2002)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2794_CR31","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1137\/140999025","volume":"26","author":"M Li","year":"2016","unstructured":"Li, M., Sun, D., Toh, K.-C.: A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization. SIAM J. Optim. 26(2), 922\u2013950 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"2794_CR32","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s10107-014-0850-5","volume":"155","author":"X Li","year":"2016","unstructured":"Li, X., Sun, D., Toh, K.-C.: A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions. Math. Program. 155(1\u20132), 333\u2013373 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"2794_CR33","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., Toh, K.-C.: A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems. SIAM J. Optim. 28(1), 433\u2013458 (2018)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"2794_CR34","doi-asserted-by":"crossref","first-page":"A4131","DOI":"10.1137\/18M1188069","volume":"40","author":"Y Li","year":"2018","unstructured":"Li, Y., Wen, Z., Yang, C., Yuan, Y.: A semismooth Newton method for semidefinite programs and its applications in electronic structure calculations. SIAM J. Sci. Comput. 40(6), A4131\u2013A4157 (2018)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"2794_CR35","first-page":"925","volume":"42","author":"L Canyi","year":"2019","unstructured":"Canyi, L., Feng, J., Chen, Y., Liu, W., Lin, Z., Yan, S.: Tensor robust principal component analysis with a new tensor nuclear norm. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 925\u2013938 (2019)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2794_CR36","doi-asserted-by":"crossref","unstructured":"Martin, D.,\u00a0Fowlkes, C.,\u00a0Tal, D., \u00a0Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proceeding of 8th International Conference on Computer Vision, volume\u00a02, pp. 416\u2013423 (2001)","DOI":"10.1109\/ICCV.2001.937655"},{"issue":"6","key":"2794_CR37","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1137\/0315061","volume":"15","author":"R Mifflin","year":"1977","unstructured":"Mifflin, R.: Semismooth and semiconvex functions in constrained optimization. SIAM J. Control. Optim. 15(6), 959\u2013972 (1977)","journal-title":"SIAM J. Control. Optim."},{"issue":"1","key":"2794_CR38","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/120892167","volume":"24","author":"A Milzarek","year":"2014","unstructured":"Milzarek, A., Ulbrich, M.: A semismooth Newton method with multidimensional filter globalization for $$\\ell _1$$-optimization. SIAM J. Optim. 24(1), 298\u2013333 (2014)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2794_CR39","doi-asserted-by":"crossref","first-page":"2916","DOI":"10.1137\/18M1181249","volume":"29","author":"A Milzarek","year":"2019","unstructured":"Milzarek, A., Xiao, X., Cen, S., Wen, Z., Ulbrich, M.: A stochastic semismooth Newton method for nonsmooth nonconvex optimization. SIAM J. Optim. 29(4), 2916\u20132948 (2019)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"2794_CR40","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1080\/02331934.2015.1105225","volume":"66","author":"BS Mordukhovich","year":"2017","unstructured":"Mordukhovich, B.S., Nam, N.M.: Geometric approach to convex subdifferential calculus. Optimization 66(6), 839\u2013873 (2017)","journal-title":"Optimization"},{"issue":"1","key":"2794_CR41","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence $$\\cal{O} (1\/t)$$ for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"key":"2794_CR42","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer Series in Operations Research and Financial Engineering. Springer, New York (2006)","edition":"2"},{"key":"2794_CR43","volume-title":"Some Continuity Properties of Polyhedral Multifunctions","author":"SM Robinson","year":"1981","unstructured":"Robinson, S.M.: Some Continuity Properties of Polyhedral Multifunctions. Springer, New York (1981)"},{"key":"2794_CR44","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis, vol. 317. Springer, New York (2009)"},{"issue":"1","key":"2794_CR45","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/moor.27.1.150.342","volume":"27","author":"D Sun","year":"2002","unstructured":"Sun, D., Sun, J.: Semismooth matrix-valued functions. Math. Oper. Res. 27(1), 150\u2013169 (2002)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"2794_CR46","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1137\/S1052623402419819","volume":"14","author":"K-C Toh","year":"2004","unstructured":"Toh, K.-C.: Solving large scale semidefinite programs via an iterative solver on the augmented systems. SIAM J. Optim. 14(3), 670\u2013698 (2004)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2794_CR47","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/s10915-017-0624-3","volume":"76","author":"X Xiao","year":"2018","unstructured":"Xiao, X., Li, Y., Wen, Z., Zhang, L.: A regularized semi-smooth Newton method with projection steps for composite convex programs. J. Sci. Comput. 76(1), 364\u2013389 (2018)","journal-title":"J. Sci. Comput."},{"key":"2794_CR48","doi-asserted-by":"crossref","unstructured":"Xu, J., Zhu, S., Soh, Y.C., Xie, L.: Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant stepsizes. In: 54th IEEE Conference on Decision and Control (CDC), pp. 2055\u20132060. IEEE (2015)","DOI":"10.1109\/CDC.2015.7402509"},{"key":"2794_CR49","doi-asserted-by":"crossref","first-page":"1698","DOI":"10.1007\/s10915-018-0680-3","volume":"76","author":"M Yan","year":"2018","unstructured":"Yan, M.: A new primal-dual algorithm for minimizing the sum of three functions with a linear operator. J. Sci. Comput. 76, 1698\u20131717 (2018)","journal-title":"J. Sci. Comput."},{"issue":"1\u20132","key":"2794_CR50","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10107-018-1280-6","volume":"174","author":"M-C Yue","year":"2019","unstructured":"Yue, M.-C., Zhou, Z., So, A.M.-C.: A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property. Math. Program. 174(1\u20132), 327\u2013358 (2019)","journal-title":"Math. Program."},{"issue":"2","key":"2794_CR51","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1137\/18M1202311","volume":"12","author":"X Zhang","year":"2019","unstructured":"Zhang, X., Ng, M.K.: A corrected tensor nuclear norm minimization method for noisy low-rank tensor completion. SIAM J. Imaging Sci. 12(2), 1231\u20131273 (2019)","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"2794_CR52","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X-Y 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)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2794_CR53","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/21M1429539","volume":"15","author":"X Zhao","year":"2022","unstructured":"Zhao, X., Bai, M., Sun, D., Zheng, L.: Robust tensor completion: equivalent surrogates, error bounds, and algorithms. SIAM J. Imag. Sci. 15(2), 625\u2013669 (2022)","journal-title":"SIAM J. Imag. Sci."},{"issue":"1","key":"2794_CR54","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10957-004-1721-7","volume":"125","author":"G Zhou","year":"2005","unstructured":"Zhou, G., Toh, K.-C.: Superlinear convergence of a Newton-type algorithm for monotone equations. J. Optim. Theory Appl. 125(1), 205\u2013221 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"2794_CR55","first-page":"8","volume":"34","author":"M Zhu","year":"2008","unstructured":"Zhu, M., Chan, T.: An efficient primal-dual hybrid gradient algorithm for total variation image restoration. UCLA CAM Report 34, 8\u201334 (2008)","journal-title":"UCLA CAM Report"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02794-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02794-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02794-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T17:40:02Z","timestamp":1739900402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02794-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,23]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2794"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02794-4","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,23]]},"assertion":[{"value":"21 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2025","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 interest to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"65"}}