{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T23:35:42Z","timestamp":1773790542846,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:00:00Z","timestamp":1748649600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:00:00Z","timestamp":1748649600000},"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":["11971159"],"award-info":[{"award-number":["11971159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071399"],"award-info":[{"award-number":["12071399"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271150"],"award-info":[{"award-number":["12271150"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the National Key R & D Program of China","award":["2021YFA001300"],"award-info":[{"award-number":["2021YFA001300"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10915-025-02951-9","type":"journal-article","created":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T13:30:33Z","timestamp":1748698233000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Accelerated Semi-Proximal ADMM with Applications to Multi-Block Sparse Optimization Problems"],"prefix":"10.1007","volume":"104","author":[{"given":"Peng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Liang","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9960-6138","authenticated-orcid":false,"given":"Minru","family":"Bai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,31]]},"reference":[{"issue":"2","key":"2951_CR1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1051\/m2an\/197509R200411","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de Dirichlet non lin\u00e9aires. Revue fran\u00e7aise d\u2019atomatique, Informatique Recherche Op\u00e9rationelle. Analyse Num\u00e9rique 9(2), 41\u201376 (1975)","journal-title":"Revue fran\u00e7aise d\u2019atomatique, Informatique Recherche Op\u00e9rationelle. Analyse Num\u00e9rique"},{"issue":"1","key":"2951_CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. with Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. with Appl."},{"issue":"1","key":"2951_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J., et al.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"2","key":"2951_CR4","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/TSP.2014.2367458","volume":"63","author":"TH Chang","year":"2014","unstructured":"Chang, T.H., Hong, M.Y., Wang, X.F.: Multi-agent distributed optimization via inexact consensus ADMM. IEEE Trans. Signal Process. 63(2), 482\u2013497 (2014)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"2951_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4(5), 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"2951_CR6","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RY Rockafellar","year":"1976","unstructured":"Rockafellar, R.Y.: Monotone operators and the proximal point algorithm. SIAM J. Control. Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control. Optim."},{"key":"2951_CR7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10589-016-9864-7","volume":"66","author":"L Chen","year":"2017","unstructured":"Chen, L., Sun, D.F., Toh, K.C.: A note on the convergence of ADMM for linearly constrained convex optimization problems. Comput. Optim. Appl. 66, 327\u2013343 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2951_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1080\/10556789408805578","volume":"4","author":"J Eckstein","year":"1994","unstructured":"Eckstein, J.: Some saddle-function splitting methods for convex programming. Optim. Methods. Softw. 4(1), 75\u201383 (1994)","journal-title":"Optim. Methods. Softw."},{"key":"2951_CR9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s101070100280","volume":"92","author":"BS He","year":"2002","unstructured":"He, B.S., Liao, L.Z., Han, D.R., Yang, H.: A new inexact alternating directions method for monotone variational inequalities. Math. Program. 92, 103\u2013118 (2002)","journal-title":"Math. Program."},{"key":"2951_CR10","unstructured":"Lin, Z.C., Liu, R.S., Su, Z.X.: Linearized alternating direction method with adaptive penalty for low-rank representation. Advances in neural information processing systems. (2011)"},{"issue":"281","key":"2951_CR11","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","volume":"82","author":"JF Yang","year":"2013","unstructured":"Yang, J.F., Yuan, X.M.: Linearized augmented lagrangian and alternating direction methods for nuclear norm minimization. Math. Comput. 82(281), 301\u2013329 (2013)","journal-title":"Math. Comput."},{"issue":"3","key":"2951_CR12","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1137\/110853996","volume":"34","author":"M Fazel","year":"2013","unstructured":"Fazel, M., Pong, T.K., Sun, D.F., Tseng, P.: Hankel matrix rank minimization with applications to system identification and realization. SIAM J. Matrix Anal. Appl. 34(3), 946\u2013977 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2951_CR13","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10107-018-1247-7","volume":"175","author":"XD Li","year":"2019","unstructured":"Li, X.D., Sun, D.F., Toh, K.C.: A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications. Math. Program. 175, 395\u2013418 (2019)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2951_CR14","first-page":"333","volume":"155","author":"XD Li","year":"2016","unstructured":"Li, X.D., Sun, D.F., 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."},{"key":"2951_CR15","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.F., Toh, K.C.: An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming. Math. Program. 161, 237\u2013270 (2017)","journal-title":"Math. Program."},{"issue":"6","key":"2951_CR16","first-page":"739","volume":"37","author":"L Chen","year":"2019","unstructured":"Chen, L., Sun, D.F., Toh, K.C., Zhang, N.: A unified algorithmic framework of symmetric Gauss-Seidel decomposition based proximal ADMMs for convex composite programming. J. Comput. 37(6), 739\u2013757 (2019)","journal-title":"J. Comput."},{"key":"2951_CR17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10107-019-01423-x","volume":"185","author":"L Chen","year":"2021","unstructured":"Chen, L., Li, X., Sun, D., Toh, K.C.: On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming. Math. Program. 185, 111\u2013161 (2021)","journal-title":"Math. Program."},{"key":"2951_CR18","doi-asserted-by":"crossref","unstructured":"Davis, D., Yin, W.: Convergence rate analysis of several splitting schemes. Splitting methods in communication, imaging, science, and engineering. 115\u2013163 (2016)","DOI":"10.1007\/978-3-319-41589-5_4"},{"issue":"1","key":"2951_CR19","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1137\/110849468","volume":"23","author":"RDC Monteiro","year":"2013","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. SIAM J. Optim. 23(1), 475\u2013507 (2013)","journal-title":"SIAM J. Optim."},{"key":"2951_CR20","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1007\/s10957-016-0877-2","volume":"169","author":"Y Cui","year":"2016","unstructured":"Cui, Y., Li, X.D., Sun, D.F., Toh, K.C.: On the convergence properties of a majorized alternating direction method of multipliers for linearly constrained convex optimization problems with coupled objective functions. J. Optim. Theory Appl. 169, 1013\u20131041 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2951_CR21","doi-asserted-by":"crossref","first-page":"1588","DOI":"10.1137\/120896219","volume":"7","author":"T Goldstein","year":"2014","unstructured":"Goldstein, T., O\u2019Donoghue, B., Setzer, S., Baraniuk, R.: Fast alternating direction optimization methods. SIAM J. Imaging Sci. 7(3), 1588\u20131623 (2014)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"2951_CR22","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"YY Ouyang","year":"2015","unstructured":"Ouyang, Y.Y., Chen, Y.M., Lan, G.H., Pasiliao, E.: An accelerated linearized alternating direction method of multipliers. SIAM J. Imaging Sci. 8(1), 644\u2013681 (2015)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"2951_CR23","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1137\/16M1082305","volume":"27","author":"YY Xu","year":"2017","unstructured":"Xu, Y.Y.: Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming. SIAM J. Optim. 27(3), 1459\u20131484 (2017)","journal-title":"SIAM J. Optim."},{"key":"2951_CR24","unstructured":"Zhang, T., Xia, Y., Li, S.R.: Lagrangian-based methods in convex optimization: prediction-correction frameworks with non-ergodic convergence rates. arXiv preprint arXiv:2304.02459v2. (2023)"},{"key":"2951_CR25","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1007\/s10915-016-0318-2","volume":"71","author":"W Deng","year":"2017","unstructured":"Deng, W., Lai, M.J., Peng, Z.M., Yin, W.T.: Parallel multi-block ADMM with $$o(1\/K)$$ convergence. J. Sci. Comput. 71, 712\u2013736 (2017)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"2951_CR26","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/s10915-018-0893-5","volume":"79","author":"H Li","year":"2019","unstructured":"Li, H., Lin, Z.C.: Accelerated alternating direction method of multipliers: An optimal $$O (1\/K)$$ non-ergodic analysis. J. Sci. Comput. 79(2), 671\u2013699 (2019)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2951_CR27","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1137\/20M1375358","volume":"32","author":"S Sabach","year":"2022","unstructured":"Sabach, S., Teboulle, M.: Faster Lagrangian-based methods in convex optimization. SIAM J. Optim. 32(1), 204\u2013227 (2022)","journal-title":"SIAM J. Optim."},{"key":"2951_CR28","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10107-021-01643-0","volume":"190","author":"D Kim","year":"2021","unstructured":"Kim, D.: Accelerated proximal point method for maximally monotone operators. Math. Program. 190, 57\u201387 (2021)","journal-title":"Math. Program."},{"key":"2951_CR29","unstructured":"Zhang, G.J., Yuan, Y.C., Sun, D.F.: An efficient HPR algorithm for the Wasserstein barycenter problem with $$ O (\\text{Dim} (P)\/\\varepsilon )$$ computational complexity. arXiv preprint arXiv:2211.14881. (2022)"},{"issue":"1","key":"2951_CR30","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s10957-024-02592-2","volume":"204","author":"B Yang","year":"2025","unstructured":"Yang, B., Zhao, X.Y., Li, X.D., Sun, D.F.: An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems. J. Optim. Theory Appl. 204(1), 9 (2025)","journal-title":"J. Optim. Theory Appl."},{"key":"2951_CR31","doi-asserted-by":"crossref","unstructured":"Sun, D.F., Yuan, Y.C., Zhang, G.J., Zhao, X.Y.: Accelerating preconditioned ADMM via degenerate proximal point mappings. SIAM J. Optim. 35(2), 1165\u20131193 (2025)","DOI":"10.1137\/24M1650053"},{"key":"2951_CR32","first-page":"15","volume":"68","author":"JF Bonnans","year":"1995","unstructured":"Bonnans, J.F., Gilbert, J.C., Lemar\u00e9chal, C., Sag\u00e1stizabal, C.A.: A family of variable metric proximal methods. Math. Program. 68, 15\u201347 (1995)","journal-title":"Math. Program."},{"key":"2951_CR33","doi-asserted-by":"crossref","first-page":"2410","DOI":"10.1137\/19M1251795","volume":"30","author":"XD Li","year":"2020","unstructured":"Li, X.D., Sun, D.F., Toh, K.-C.: An asymptotically superlinearly convergent semismooth Newton augmented Lagrangian method for linear programming. SIAM J. Optim. 30, 2410\u20132440 (2020)","journal-title":"SIAM J. Optim."},{"key":"2951_CR34","unstructured":"Chen, K.H., Sun, D.F., Yuan, Y.C.: HPR-LP: An implementation of an HPR method for solving linear programming. arXiv preprint arXiv:2408.12179. (2024)"},{"key":"2951_CR35","unstructured":"Rockafellar, R.: Convex Analysis. Princeton University Press Princeton, 1970"},{"issue":"2","key":"2951_CR36","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1287\/moor.2017.0875","volume":"43","author":"DR Han","year":"2018","unstructured":"Han, D.R., Sun, D.F., Zhang, L.W.: Linear rate convergence of the alternating direction method of multipliers for convex composite programming. Math. Oper. Res. 43(2), 622\u2013637 (2018)","journal-title":"Math. Oper. Res."},{"key":"2951_CR37","doi-asserted-by":"crossref","first-page":"76131","DOI":"10.1109\/ACCESS.2019.2914461","volume":"7","author":"QH Liu","year":"2019","unstructured":"Liu, Q.H., Shen, X.Y., Gu, Y.T.: Linearized ADMM for non-convex non-smooth optimization with convergence analysis. IEEE Access. 7, 76131\u201376144 (2019)","journal-title":"IEEE Access."},{"key":"2951_CR38","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.ins.2023.02.012","volume":"629","author":"FS Wu","year":"2023","unstructured":"Wu, F.S., Li, C.Q., Li, Y.T., Tang, N.S.: Robust low-rank tensor completion via new regularized model with approximate SVD. Inf. Sci. 629, 646\u2013666 (2023)","journal-title":"Inf. Sci."},{"key":"2951_CR39","first-page":"242","volume":"8858","author":"W Deng","year":"2013","unstructured":"Deng, W., Yin, W.T., Zhang, Y.: Group sparse optimization by alternating direction method. Wavelets and Sparsity XV. 8858, 242\u2013256 (2013)","journal-title":"Wavelets and Sparsity XV."},{"issue":"1\u20132","key":"2951_CR40","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10107-014-0826-5","volume":"155","author":"CH Chen","year":"2016","unstructured":"Chen, C.H., He, B.S., Ye, Y.Y., Yuan, X.M.: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent. Math. Program. 155(1\u20132), 57\u201379 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"2951_CR41","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10915-022-01815-w","volume":"91","author":"JS Zeng","year":"2022","unstructured":"Zeng, J.S., Yin, W.T., Zhou, D.X.: Moreau envelope augmented Lagrangian method for non-convex optimization with linear constraints. J. Sci. Comput. 91(2), 61 (2022)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"2951_CR42","doi-asserted-by":"crossref","first-page":"2272","DOI":"10.1137\/19M1242276","volume":"30","author":"JW Zhang","year":"2020","unstructured":"Zhang, J.W., Luo, Z.Q.: A proximal alternating direction method of multiplier for linearly constrained non-convex minimization. SIAM J. Optim. 30(3), 2272\u20132302 (2020)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2951_CR43","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1137\/20M135474X","volume":"32","author":"JW Zhang","year":"2022","unstructured":"Zhang, J.W., Luo, Z.Q.: A global dual error bound and its application to the analysis of linearly constrained non-convex optimization. SIAM J. Optim. 32(3), 2319\u20132346 (2022)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2951_CR44","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"J-S Pang","year":"2016","unstructured":"Pang, J.-S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of non-smooth DC programs. Math. Oper. Res. 42(1), 95\u2013118 (2016)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2951_CR45","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/21M1429539","volume":"15","author":"XY Zhao","year":"2022","unstructured":"Zhao, X.Y., Bai, M.R., Sun, D.F., Zheng, L.B.: Robust tensor completion: Equivalent surrogates, error bounds, and algorithms. SIAM J. Imaging Sci. 15(2), 625\u2013669 (2022)","journal-title":"SIAM J. Imaging Sci."},{"key":"2951_CR46","doi-asserted-by":"crossref","unstructured":"Lu, C.Y., F, J.S., C, Y.D., L, W., L, Z.C., Y, S.C.: Tensor robust principal component analysis with a new tensor nuclear norm. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 925\u2013938 (2019)","DOI":"10.1109\/TPAMI.2019.2891760"},{"issue":"10","key":"2951_CR47","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1109\/TIP.2005.852196","volume":"14","author":"RH Chan","year":"2005","unstructured":"Chan, R.H., Ho, C.W., Nikolova, M.: Salt-and-pepper noise removal by median-type noise detectors and detail-preserving regularization. IEEE Transactions on image. 14(10), 1479\u20131485 (2005)","journal-title":"IEEE Transactions on image."},{"issue":"4","key":"2951_CR48","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/s10898-018-0675-5","volume":"72","author":"YL Liu","year":"2018","unstructured":"Liu, Y.L., Bi, S.J., Pan, S.H.: Equivalent Lipschitz surrogates for zero-norm and rank optimization problems. J. Glob. Optim. 72(4), 679\u2013704 (2018)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"2951_CR49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02951-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02951-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02951-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T06:41:22Z","timestamp":1750315282000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02951-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,31]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2951"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02951-9","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,31]]},"assertion":[{"value":"25 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 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 not disclosed any conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"30"}}