{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T07:42:46Z","timestamp":1751701366865,"version":"3.34.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T00:00:00Z","timestamp":1735862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T00:00:00Z","timestamp":1735862400000},"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":["12171106"],"award-info":[{"award-number":["12171106"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Science and Technology Program","award":["AD23023001","12271113","12261008"],"award-info":[{"award-number":["AD23023001","12271113","12261008"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12401403"],"award-info":[{"award-number":["12401403"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovation Project of Guangxi Graduate Education","award":["YCBZ2024001"],"award-info":[{"award-number":["YCBZ2024001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s10915-024-02743-7","type":"journal-article","created":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T06:53:10Z","timestamp":1735887190000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Partially Feasible Jacobi-Type Distributed SQO Method for Two-Block General Linearly Constrained Smooth Optimization"],"prefix":"10.1007","volume":"102","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8048-7397","authenticated-orcid":false,"given":"Jinbao","family":"Jian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenrui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunming","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianghua","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,3]]},"reference":[{"issue":"8","key":"2743_CR1","first-page":"1","volume":"24","author":"C Aswathy","year":"2015","unstructured":"Aswathy, C., Sowmya, V., Soman, K.P.: ADMM based hyperspectral image classification improved by denoising using Legendre Fenchel transformation. Indian J. Sci. Technol. 24(8), 1\u201336 (2015)","journal-title":"Indian J. Sci. Technol."},{"key":"2743_CR2","unstructured":"Wang, Z. Y., Kung, S-Y., Zhang, J. Y., Khan, J., Xuan, J. H., Wang, Y.: Computational intelligence approach for gene expression data mining and classification. Multimedia. and Expo. 2003. ICME \u201903. Proceedings. (2003)"},{"issue":"3","key":"2743_CR3","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1109\/72.846734","volume":"11","author":"Y Wang","year":"2000","unstructured":"Wang, Y., Luo, L., Freedman, M.T., Kung, S.-Y.: Probabilistic principal component subspaces: a hierarchical finite mixture model for data visualization. IEEE Trans. Neural Netw. Learn. Syst. 11(3), 625\u2013636 (2000)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"2","key":"2743_CR4","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/JSTSP.2010.2042333","volume":"4","author":"JF Yang","year":"2010","unstructured":"Yang, J.F., Zhang, Y., Yin, W.T.: A fast alternating direction method for TVL1-L2 signal reconstruction from partial fourier data. IEEE J. Sel. Topics Signal Process. 4(2), 288\u2013297 (2010)","journal-title":"IEEE J. Sel. Topics Signal Process."},{"key":"2743_CR5","unstructured":"Goldstein, T., Li, M., Yuan, X. M.: Adaptive primal-dual splitting methods for statistical learning and image processing. In: Proceedings of the 28th international conference on neural information processing systems. 2: 2089\u20132097 (2015)"},{"key":"2743_CR6","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/s10957-020-01697-8","volume":"186","author":"JB Jian","year":"2020","unstructured":"Jian, J.B., Zhang, C., Yin, J.H.: Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems. J. Optim. Theory App. 186, 226\u2013247 (2020)","journal-title":"J. Optim. Theory App."},{"key":"2743_CR7","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.ijepes.2009.11.002","volume":"32","author":"A Theerthamalai","year":"2010","unstructured":"Theerthamalai, A., Maheswarapu, S.: An effective non-iterative \u201c$$\\lambda $$-logic based\u2019\u2019 algorithm for economic dispatch of generators with cubic fuel cost function. Int. J. Elec. Power. 32, 539\u2013542 (2010)","journal-title":"Int. J. Elec. Power."},{"key":"2743_CR8","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1109\/59.260861","volume":"8","author":"DC Walters","year":"1993","unstructured":"Walters, D.C., Sheble, G.B.: Genetic algorithm solution of economic dispatch with valve point loading. IEEE Trans. Power Syst. 8, 1325\u20131332 (1993)","journal-title":"IEEE Trans. Power Syst."},{"key":"2743_CR9","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 App. 4, 303\u2013320 (1969)","journal-title":"J. Optim. Theory App."},{"key":"2743_CR10","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. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"2743_CR11","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"BS He","year":"2012","unstructured":"He, B.S., Yuan, X.M.: On the $$O(1\/n)$$ convergence rate of the Douglas-Rachford alternating direction method. SIAM J. Numer. Anal. 50, 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"key":"2743_CR12","first-page":"465","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, 465\u2013507 (2013)","journal-title":"SIAM J. Optim."},{"key":"2743_CR13","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1137\/13090849X","volume":"24","author":"BS He","year":"2014","unstructured":"He, B.S., Liu, H., Wang, Z., Yuan, X.M.: A strictly contractive Peaceman-Rachford splitting method for convex programming. SIAM J. Optim. 24, 1011\u20131040 (2014)","journal-title":"SIAM J. Optim."},{"key":"2743_CR14","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s00211-014-0673-6","volume":"130","author":"BS He","year":"2015","unstructured":"He, B.S., Yuan, X.M.: On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers. Numer. Math. 130, 567\u2013577 (2015)","journal-title":"Numer. Math."},{"key":"2743_CR15","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1093\/imanum\/drt060","volume":"35","author":"BS He","year":"2015","unstructured":"He, B.S., Tao, M., Yuan, X.M.: A splitting method for separable convex programming. IMA J. Numer. Anal. 35, 394\u2013426 (2015)","journal-title":"IMA J. Numer. Anal."},{"key":"2743_CR16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.5802\/smai-jcm.6","volume":"1","author":"BS He","year":"2015","unstructured":"He, B.S., Tao, M., Yuan, X.M.: Block-wise alternating direction method of multipliers for multiple-block convex programming and beyond. SMAI J. Comput. Math. 1, 145\u2013174 (2015)","journal-title":"SMAI J. Comput. Math."},{"key":"2743_CR17","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."},{"key":"2743_CR18","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s10589-019-00087-9","volume":"73","author":"B Eike","year":"2019","unstructured":"Eike, B., Christian, K.: Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces. Comput. Optim. Appl. 73, 755\u2013790 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"2743_CR19","doi-asserted-by":"crossref","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"GY Li","year":"2015","unstructured":"Li, G.Y., Pong, T.K.: Global convergence of splitting methods for nonconvex composite optimization. SIAM J. Optim. 25, 2434\u20132460 (2015)","journal-title":"SIAM J. Optim."},{"key":"2743_CR20","first-page":"2816","volume":"27","author":"H Wang","year":"2014","unstructured":"Wang, H., Banerjee, A.: Bregman alternating direction method of multipliers. Adv. Neural Inf. Process. Syst. 27, 2816\u20132824 (2014)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2743_CR21","unstructured":"Wang, F. H., Xu, Z. B., Xu, H. K.: Convergence of Bregman alternating direction method with multipliers for nonconvex composite problems. arXiv:1410.8625v3 (2014)"},{"key":"2743_CR22","first-page":"3139","volume":"41","author":"JB Jian","year":"2021","unstructured":"Jian, J.B., Xu, X., Chao, M.T.: Convergence of proximal ADMM with an over-relaxation stepsize for nonconvex two-block problem. J. Syst. Sci. Math. Sci. 41, 3139\u20133150 (2021)","journal-title":"J. Syst. Sci. Math. Sci."},{"key":"2743_CR23","first-page":"1005","volume":"64","author":"JB Jian","year":"2021","unstructured":"Jian, J.B., Liu, P.J., Jiang, X.Z.: A partially symmetric regularized alternating direction method of multipliers for nonconvex multi-block optimization. Acta Math. Sinica 64, 1005\u20131026 (2021)","journal-title":"Acta Math. Sinica"},{"key":"2743_CR24","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1137\/140990309","volume":"26","author":"MY Hong","year":"2016","unstructured":"Hong, M.Y., Luo, Z.-Q., Razaviyayn, M.: Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems. SIAM J. Optim. 26, 337\u2013364 (2016)","journal-title":"SIAM J. Optim."},{"key":"2743_CR25","first-page":"1","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. Le. 3, 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Le."},{"key":"2743_CR26","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1137\/18M1163993","volume":"30","author":"T Andreas","year":"2020","unstructured":"Andreas, T., Panagiotis, P.: Douglas-Rachford splitting and ADMM for nonconvex optimization: Tight convergence results. SIAM J. Optim. 30, 149\u2013181 (2020)","journal-title":"SIAM J. Optim."},{"key":"2743_CR27","volume":"390","author":"JB Jian","year":"2021","unstructured":"Jian, J.B., Liu, P.J., Yin, J.H.: A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application. J. Comput. Appl. Math. 390, 113368 (2021)","journal-title":"J. Comput. Appl. Math."},{"key":"2743_CR28","unstructured":"Wilson, R. B.: A simplicial method for convex programming. PhD. thesis. (1963)"},{"key":"2743_CR29","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01584986","volume":"3","author":"SM Robinson","year":"1972","unstructured":"Robinson, S.M.: A quadratically-convergent algorithm for general nonlinear programming problems. Math. Program. 3, 145\u2013156 (1972)","journal-title":"Math. Program."},{"key":"2743_CR30","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01580395","volume":"11","author":"S-P Han","year":"1976","unstructured":"Han, S.-P.: Superlinearly convergent variable metric algorithms for general nonlinear programming problems. Math. Program. 11, 263\u2013282 (1976)","journal-title":"Math. Program."},{"key":"2743_CR31","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1137\/0325051","volume":"25","author":"ER Panier","year":"1987","unstructured":"Panier, E.R., Tits, A.L.: A superlinearly convergent feasible method for the solution of inequality constrained optimization problems. SIAM J. Control. Optim. 25, 934\u2013950 (1987)","journal-title":"SIAM J. Control. Optim."},{"key":"2743_CR32","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01581247","volume":"59","author":"ER Panier","year":"1993","unstructured":"Panier, E.R., Tits, A.L.: On combining feasibility descent and superlinearly convergence in inequality constrained optimization. Math. Program. 59, 261\u2013276 (1993)","journal-title":"Math. Program."},{"key":"2743_CR33","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10589-005-3230-5","volume":"31","author":"JB Jian","year":"2005","unstructured":"Jian, J.B.: A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints. Comput. Optim. Appl. 31, 335\u2013361 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"2743_CR34","first-page":"955","volume":"182","author":"JB Jian","year":"2006","unstructured":"Jian, J.B., Zheng, H.Y., Tang, C.M.: A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization. Appl. Math. Comput. 182, 955\u2013976 (2006)","journal-title":"Appl. Math. Comput."},{"key":"2743_CR35","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1080\/01630560802000918","volume":"29","author":"JB Jian","year":"2008","unstructured":"Jian, J.B., Tang, C.M., Hu, Q.J., Zheng, H.Y.: A new superlinearly convergent strongly subfeasible sequential quadratic programming algorithm for inequality constrained optimization. Numer. Funct. Anal. Optim. 29, 376\u2013409 (2008)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"2743_CR36","doi-asserted-by":"crossref","first-page":"1507","DOI":"10.1137\/130921738","volume":"24","author":"M Heinkenschloss","year":"2014","unstructured":"Heinkenschloss, M., Ridzal, D.: A matrix-free trust-region SQP method for equality constrained optimization. SIAM J. Optim. 24, 1507\u20131541 (2014)","journal-title":"SIAM J. Optim."},{"key":"2743_CR37","doi-asserted-by":"crossref","first-page":"1885","DOI":"10.1137\/140996677","volume":"25","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Loh, Y.L., Robinson, D.P.: A nonmonotone filter SQP method: local convergence and numerical results. SIAM J. Optim. 25, 1885\u20131911 (2015)","journal-title":"SIAM J. Optim."},{"key":"2743_CR38","first-page":"1388","volume":"25","author":"MW Xu","year":"2014","unstructured":"Xu, M.W., Ye, J.J., Zhang, L.W.: Smoothing SQP methods for solving degenerate nonsmooth constrained optimization problems with applications to bilevel programs. SIAM J. Optim. 25, 1388\u20131410 (2014)","journal-title":"SIAM J. Optim."},{"key":"2743_CR39","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10107-016-1066-7","volume":"163","author":"PE Gill","year":"2016","unstructured":"Gill, P.E., Kungurtsev, V., Robinson, D.P.: A stabilized SQP method: superlinear convergence. Math. Program. 163, 369\u2013410 (2016)","journal-title":"Math. Program."},{"key":"2743_CR40","doi-asserted-by":"crossref","first-page":"1822","DOI":"10.1137\/18M1176488","volume":"30","author":"JV Burke","year":"2020","unstructured":"Burke, J.V., Curtis, F.E., Wang, H., Wang, J.S.: Inexact sequential quadratic optimization with penalty parameter updates within the QP solver. SIAM J. Optim. 30, 1822\u20131849 (2020)","journal-title":"SIAM J. Optim."},{"key":"2743_CR41","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1137\/20M1354556","volume":"31","author":"AS Berahas","year":"2021","unstructured":"Berahas, A.S., Curtis, F.E., Robinson, D.P., Zhou, B.Y.: Sequential quadratic optimization for nonlinear equality constrained stochastic optimization. SIAM J. Optim. 31, 1352\u20131379 (2021)","journal-title":"SIAM J. Optim."},{"key":"2743_CR42","first-page":"79","volume":"22","author":"JB Jian","year":"2018","unstructured":"Jian, J.B., Lao, Y.X., Chao, M.T., Ma, G.D.: ADMM-SQP algorithm for two blocks linear constrained nonconvex optimization. Oper. Res. Trans. 22, 79\u201392 (2018). (in Chinese)","journal-title":"Oper. Res. Trans."},{"key":"2743_CR43","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1360\/SSM-2020-0297","volume":"52","author":"JB Jian","year":"2022","unstructured":"Jian, J.B., Zhang, C., Yin, J.H.: A Peaceman-Rachford splitting sequential quadratic programming method with double step-lengths for two-block nonconvex optimization. Sci. Sin. Math 52, 1449\u20131476 (2022). (in Chinese)","journal-title":"Sci. Sin. Math"},{"key":"2743_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10473-023-0101-z","volume":"43","author":"JB Jian","year":"2023","unstructured":"Jian, J.B., Zhang, C., Liu, P.J.: A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization. Acta Math. Sin. 43, 1\u201324 (2023)","journal-title":"Acta Math. Sin."},{"key":"2743_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-023-00523-y","author":"JB Jian","year":"2024","unstructured":"Jian, J.B., Ma, G.D., Xu, X., Han, D.L.: Monotone splitting SQP algorithms for two-block nonconvex optimization problems with general linear constraints and applications. J. Oper. Res. Soc. China (2024). https:\/\/doi.org\/10.1007\/s40305-023-00523-y","journal-title":"J. Oper. Res. Soc. China"},{"key":"2743_CR46","doi-asserted-by":"crossref","first-page":"1679","DOI":"10.1137\/21M1449099","volume":"34","author":"KZ Sun","year":"2024","unstructured":"Sun, K.Z., Sun, X.A.: Dual descent augmented Lagrangian method and alternating direction method of multipliers. SIAM J. Optim. 34, 1679\u20131707 (2024)","journal-title":"SIAM J. Optim."},{"key":"2743_CR47","volume-title":"Fast Algorithms for Smooth Constrained Optimazation: Theoretical Analysis and Numerical Experiments","author":"JB Jian","year":"2010","unstructured":"Jian, J.B.: Fast Algorithms for Smooth Constrained Optimazation: Theoretical Analysis and Numerical Experiments. Science Press, Beijing (2010)"},{"key":"2743_CR48","unstructured":"Maratos, N.: Exact penalty function algorithms for finite dimensional and control optimization problems. PhD. thesis. (1978)"},{"key":"2743_CR49","first-page":"1","volume":"34","author":"ZM Wu","year":"2017","unstructured":"Wu, Z.M., Li, M., Wang, D.Z.W., Han, D.R.: A symmetric alternating direction method of multipliers for separable nonconvex minimization problems. Asia-Pac. J. Oper. Res. 34, 1\u201327 (2017)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"2743_CR50","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF00934594","volume":"30","author":"W Hock","year":"1980","unstructured":"Hock, W., Schittkowski, K.: Tests examples for nonlinear programming codes. J. Optim. Theory Appl. 30, 127\u2013129 (1980)","journal-title":"J. Optim. Theory Appl."},{"key":"2743_CR51","unstructured":"OPTI Toolbox-a free MATLAB toolbox for optimization. https:\/\/github.com\/jonathancurrie\/OPTI\/releases"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02743-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02743-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02743-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T18:36:47Z","timestamp":1738175807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02743-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,3]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2743"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02743-7","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2025,1,3]]},"assertion":[{"value":"30 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"33"}}