{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T04:03:05Z","timestamp":1763092985054,"version":"3.40.5"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T00:00:00Z","timestamp":1740528000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T00:00:00Z","timestamp":1740528000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100016047","name":"Science Fund of the Republic of Serbia","doi-asserted-by":"crossref","award":["7359","7359"],"award-info":[{"award-number":["7359","7359"]}],"id":[{"id":"10.13039\/501100016047","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100012740","name":"Gruppo Nazionale per l\u2019Analisi Matematica, la Probabilit\u00e0 e le loro Applicazioni","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012740","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["812912"],"award-info":[{"award-number":["812912"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We consider two formulations for distributed optimization wherein <jats:italic>N<\/jats:italic> nodes in a generic connected network solve a problem of common interest: distributed personalized optimization and consensus optimization. A new method termed DINAS (Distributed Inexact Newton method with Adaptive step size) is proposed. DINAS employs large adaptively computed step sizes, requires a reduced global parameters knowledge with respect to existing alternatives, and can operate without any local Hessian inverse calculations nor Hessian communications. When solving personalized distributed learning formulations, DINAS achieves quadratic convergence with respect to computational cost and linear convergence with respect to communication cost, the latter rate being independent of the local functions condition numbers or of the network topology. When solving consensus optimization problems, DINAS is shown to converge to the global solution. Extensive numerical experiments demonstrate significant improvements of DINAS over existing alternatives. As a result of independent interest, we provide for the first time convergence analysis of the Newton method with the adaptive Polyak\u2019s step size when the Newton direction is computed inexactly in centralized environment.\n<\/jats:p>","DOI":"10.1007\/s10589-025-00666-z","type":"journal-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T07:26:35Z","timestamp":1740554795000},"page":"683-715","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Distributed inexact Newton method with adaptive step sizes"],"prefix":"10.1007","volume":"91","author":[{"given":"Du\u0161an","family":"Jakoveti\u0107","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3348-7233","authenticated-orcid":false,"given":"Nata\u0161a","family":"Kreji\u0107","sequence":"additional","affiliation":[]},{"given":"Greta","family":"Malaspina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,26]]},"reference":[{"issue":"9","key":"666_CR1","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1109\/LSP.2018.2859596","volume":"25","author":"I Almeida","year":"2018","unstructured":"Almeida, I., Xavier, J.: DJAM: distributed Jacobi asynchronous method for learning personal models. IEEE Signal Process. Lett. 25(9), 1389\u20131392 (2018)","journal-title":"IEEE Signal Process. Lett."},{"issue":"10","key":"666_CR2","doi-asserted-by":"publisher","first-page":"5396","DOI":"10.1109\/TSP.2012.2206587","volume":"60","author":"C Eksin","year":"2012","unstructured":"Eksin, C., Ribeiro, A.: Distributed network optimization with heuristic rational agents. IEEE Trans. Signal Process. 60(10), 5396\u20135411 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"666_CR3","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1109\/TAC.2019.2922191","volume":"65","author":"NK Jerinki\u0107","year":"2020","unstructured":"Jerinki\u0107, N.K., Jakoveti\u0107, D., Kreji\u0107, N., Bajovi\u0107, D.: Distributed second-order methods with increasing number of working nodes. IEEE Trans. Autom. Control 65(2), 846\u2013853 (2020)","journal-title":"IEEE Trans. Autom. Control"},{"doi-asserted-by":"crossref","unstructured":"Mansoori, F., Wei, E.: Superlinearly convergent asynchronous distributed network Newton method. In: 2017 IEEE 56th Annual Conference on Decision and Control (CDC), pp. 2874-2879, (2017)","key":"666_CR4","DOI":"10.1109\/CDC.2017.8264076"},{"unstructured":"Vanhaesebrouck, P., Bellet A., Tommasi, M.: Decentralized collaborative learning of personalized models over networks. In: AISTATS (2017)","key":"666_CR5"},{"unstructured":"Hanzely, F., Hanzely, S., Horv\u00e1th, S., Richt\u00e1rik, P.: Lower bounds and optimal algorithms for personalized federated learning. In: Proceedings of the 34th International Conference on Neural Information Processing Systems, NIPS\u201920. Curran Associates Inc., (2020)","key":"666_CR6"},{"issue":"1","key":"666_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","volume":"54","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Ozdaglar, A.: Distributed subgradient methods for multi-agent optimization. IEEE Trans. Autom. Control 54(1), 48\u201361 (2009)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"666_CR8","first-page":"31","volume":"5","author":"D Jakoveti\u0107","year":"2019","unstructured":"Jakoveti\u0107, D.: A unification and generalization of exact distributed first-order methods. IEEE Trans. Signal Inf. Process. Over Netw. 5(1), 31\u201346 (2019)","journal-title":"IEEE Trans. Signal Inf. Process. Over Netw."},{"issue":"2","key":"666_CR9","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/15M1038049","volume":"27","author":"D Jakoveti\u0107","year":"2017","unstructured":"Jakoveti\u0107, D., Bajovi\u0107, D., Kreji\u0107, N., Krklec Jerinki\u0107, N.: Newton-like method with diagonal correction for distributed optimization. SIAM J. Optim. 27(2), 1171\u20131203 (2017)","journal-title":"SIAM J. Optim."},{"doi-asserted-by":"crossref","unstructured":"Jakoveti\u0107, D., Moura, J.\u00a0M.\u00a0F., Xavier, J.: Nesterov-like gradient algorithms. In: CDC\u201912, 51$$^{\\rm st}$$ IEEE Conference on Decision and Control, pp. 5459\u20135464, (2012)","key":"666_CR10","DOI":"10.1109\/CDC.2012.6425938"},{"issue":"5","key":"666_CR11","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1109\/TAC.2014.2298712","volume":"59","author":"D Jakoveti\u0107","year":"2014","unstructured":"Jakoveti\u0107, D., Xavier, J., Moura, J.M.F.: Fast distributed gradient methods. IEEE Trans. Autom. Control 59(5), 1131\u20131146 (2014)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"666_CR12","first-page":"1245","volume":"5","author":"N Li","year":"2017","unstructured":"Li, N., Qu, G.: Harnessing smoothness to accelerate distributed optimization. IEEE Trans. Control Netw. Syst. 5(3), 1245\u20131260 (2017)","journal-title":"IEEE Trans. Control Netw. Syst."},{"issue":"4","key":"666_CR13","doi-asserted-by":"publisher","first-page":"2597","DOI":"10.1137\/16M1084316","volume":"27","author":"A Nedi\u0107","year":"2017","unstructured":"Nedi\u0107, A., Olshevsky, A., Shi, W.: Achieving geometric convergence for distributed optimization over time-varying graphs. SIAM J. Optim. 27(4), 2597\u20132633 (2017)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"666_CR14","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1137\/14096668X","volume":"25","author":"W Shi","year":"2015","unstructured":"Shi, W., Ling, Q., Wu, G., Yin, W.: Extra: an exact first-order algorithm for decentralized consensus optimization. SIAM J. Optim. 25(2), 944\u2013966 (2015)","journal-title":"SIAM J. Optim."},{"doi-asserted-by":"crossref","unstructured":"Sundararajan, A., Van\u00a0Scoy, B., Lessard, L.: Analysis and design of first-order distributed optimization algorithms over time-varying graphs. arxiv preprint, arXiv:1907.05448, (2019)","key":"666_CR15","DOI":"10.23919\/ACC.2019.8814838"},{"doi-asserted-by":"crossref","unstructured":"Xu, J., Zhu, S., Soh, Y.\u00a0C., Xie, L.: Augmented distributed gradient methods for multi-agent optimization under uncoordinated constant step sizes. In: IEEE Conference on Decision and Control, pp. 2055\u20132060, (2015)","key":"666_CR16","DOI":"10.1109\/CDC.2015.7402509"},{"issue":"1","key":"666_CR17","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1109\/TSP.2016.2617829","volume":"65","author":"A Mokhtari","year":"2017","unstructured":"Mokhtari, A., Ling, Q., Ribeiro, A.: Network Newton distributed optimization methods. IEEE Trans. Signal Process. 65(1), 146\u2013161 (2017)","journal-title":"IEEE Trans. Signal Process."},{"doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A., Olshevsky, A., Shi, W., Uribe, C.\u00a0A.: Geometrically convergent distributed optimization with uncoordinated step sizes. In: American Control Conference, pp. 3950\u20133955, (2017)","key":"666_CR18","DOI":"10.23919\/ACC.2017.7963560"},{"issue":"6","key":"666_CR19","doi-asserted-by":"publisher","first-page":"2627","DOI":"10.1109\/TAC.2019.2942513","volume":"65","author":"R Xin","year":"2020","unstructured":"Xin, R., Khan, U.A.: Distributed heavy-ball: a generalization and acceleration of first-order methods with gradient tracking. IEEE Trans. Autom. Control 65(6), 2627\u20132633 (2020)","journal-title":"IEEE Trans. Autom. Control"},{"key":"666_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13634-018-0596-y","volume":"2019","author":"R Xin","year":"2019","unstructured":"Xin, R., Xi, C., Khan, U.A.: Frost-fast row-stochastic optimization with uncoordinated step-sizes. EURASIP J. Adv. Signal Process.-Spec. Issue Optim., Learn, Adapt. Over Netw. 2019, 1 (2019)","journal-title":"EURASIP J. Adv. Signal Process.-Spec. Issue Optim., Learn, Adapt. Over Netw."},{"issue":"3","key":"666_CR21","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1109\/TSP.2018.2875898","volume":"67","author":"K Yuan","year":"2019","unstructured":"Yuan, K., Ying, B., Zhao, X., Sayed, A.H.: Exact diffusion for distributed optimization and learning\u2014part I: algorithm development. IEEE Trans. Signal Process. 67(3), 708\u2013723 (2019)","journal-title":"IEEE Trans. Signal Process."},{"key":"666_CR22","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s10589-019-00131-8","volume":"74","author":"D Jakoveti\u0107","year":"2019","unstructured":"Jakoveti\u0107, D., Kreji\u0107, N., Krklec Jerinki\u0107, N.: Exact spectral-like gradient method for distributed optimization. Comput. Optim. Appl. 74, 703\u2013728 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"11","key":"666_CR23","doi-asserted-by":"publisher","first-page":"4769","DOI":"10.1109\/TAC.2020.2969721","volume":"60","author":"F Saadatniaki","year":"2020","unstructured":"Saadatniaki, F., Xin, R., Khan, U.A.: Decentralized optimization over time-varying directed graphs with row and column-stochastic matrices. IEEE Trans. Autom. Control 60(11), 4769\u20134780 (2020)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"5","key":"666_CR24","doi-asserted-by":"publisher","first-page":"4012","DOI":"10.1109\/TCYB.2020.3011819","volume":"52","author":"M Wu","year":"2022","unstructured":"Wu, M., Xiong, N., Vasilakos, A.V., Leung, V.C.M., Chen, C.L.P.: Rnn-k: a reinforced Newton method for consensus-based distributed optimization and control over multiagent systems. IEEE Trans. Cybern. 52(5), 4012\u20134026 (2022)","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"666_CR25","first-page":"507","volume":"2","author":"A Mokhtari","year":"2016","unstructured":"Mokhtari, A., Shi, W., Ling, Q., Ribeiro, A.: A decentralized second-order method with exact linear convergence rate for consensus optimization. IEEE Trans. Signal Inf. Process. Over Netw. 2(4), 507\u2013522 (2016)","journal-title":"IEEE Trans. Signal Inf. Process. Over Netw."},{"key":"666_CR26","first-page":"755","volume":"8","author":"D Jakoveti\u0107","year":"2022","unstructured":"Jakoveti\u0107, D., Kreji\u0107, N., Krklec Jerinki\u0107, N.: A Hessian inversion-free exact second order method for distributed consensus optimization. IEEE Trans. Signal Inf. Process. Over Netw. 8, 755\u2013770 (2022)","journal-title":"IEEE Trans. Signal Inf. Process. Over Netw."},{"key":"666_CR27","first-page":"346","volume":"7","author":"J Zhang","year":"2021","unstructured":"Zhang, J., Ling, Q., So, A.M.C.: A Newton tracking algorithm with exact linear convergence for decentralized consensus optimization. IEEE Trans. Signal Inf. Process. Over Netw. 7, 346\u2013358 (2021)","journal-title":"IEEE Trans. Signal Inf. Process. Over Netw."},{"key":"666_CR28","doi-asserted-by":"publisher","first-page":"110156","DOI":"10.1016\/j.automatica.2021.110156","volume":"138","author":"J Zhang","year":"2022","unstructured":"Zhang, J., You, K., Ba\u015far, T.: Distributed adaptive Newton methods with global superlinear convergence. Automatica 138, 110156 (2022)","journal-title":"Automatica"},{"issue":"6","key":"666_CR29","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1080\/10556788.2019.1669154","volume":"35","author":"B Polyak","year":"2020","unstructured":"Polyak, B., Tremba, A.: New versions of Newton method: step-size choice, convergence domain and under-determined equations. Optim. Methods Softw. 35(6), 1272\u20131303 (2020)","journal-title":"Optim. Methods Softw."},{"unstructured":"Daneshmand, A., Scutari, G., Dvurechensky, P. and Gasnikov, A.: Newton method over networks is fast up to the statistical precision. In Marina, M., and Tong Z. (eds.) Proceedings of the 38th International Conference on Machine Learning, vol. 139 of Proceedings of Machine Learning Research, pp. 2398\u20132409. PMLR, (2021)","key":"666_CR30"},{"key":"666_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/LSP.2021.3084510","volume":"28","author":"E Berglund","year":"2021","unstructured":"Berglund, E., Magn\u00fasson, S., Johansson, M.: Distributed newton method over graphs: Can sharing of second-order information eliminate the condition number dependence? IEEE Signal Process. Lett. 28, 1 (2021)","journal-title":"IEEE Signal Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Liu H., Zhang J., Man-Cho S.A., Ling, Q.: A communication-efficient decentralized newton\u2019s method with provably faster convergence, (2022)","key":"666_CR32","DOI":"10.1109\/TSIPN.2023.3290397"},{"key":"666_CR33","first-page":"400","volume":"2","author":"RS Dembo","year":"1982","unstructured":"Dembo, R.S., Eisenstat, S.C., Steihaug, T.: Inexact Newton methods. SIAM J. Optim. 2, 400\u2013408 (1982)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"666_CR34","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.1137\/130943170","volume":"26","author":"K Yuan","year":"2016","unstructured":"Yuan, K., Ling, Q., Yin, W.: On the convergence of decentralized gradient descent. SIAM J. Optim. 26(3), 1835\u20131854 (2016)","journal-title":"SIAM J. Optim."},{"key":"666_CR35","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1007\/s10589-023-00475-2","volume":"85","author":"C Kanzow","year":"2023","unstructured":"Kanzow, C., Lapucci, M.: Inexact penalty decomposition methods for optimization problems with geometric constraint. Comput. Optim. Appl. 85, 937\u2013971 (2023)","journal-title":"Comput. Optim. Appl."},{"key":"666_CR36","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/0804022","volume":"4","author":"SC Eisenstat","year":"1994","unstructured":"Eisenstat, S.C., Walker, H.F.: Globally convergent inexact Newton methods. SIAM J. Optim. 4, 393\u2013422 (1994)","journal-title":"SIAM J. Optim."},{"doi-asserted-by":"crossref","unstructured":"Liu, J., Mou, S., Morse A.\u00a0S.: A distributed algorithm for solving a linear algebraic equation. In: Proceedings of the 51st Annual Allerton Conference on Communication, Control, and Computing, vol. 60(11), pp. 267\u2013274, (2013)","key":"666_CR37","DOI":"10.1109\/Allerton.2013.6736534"},{"key":"666_CR38","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.automatica.2017.05.004","volume":"83","author":"J Liu","year":"2017","unstructured":"Liu, J., Morse, A.S., Nedi\u0107, A., Ba\u015far, T.: Exponential convergence of a distributed algorithm for solving linear algebraic equations. Automatica 83, 37\u201346 (2017)","journal-title":"Automatica"},{"issue":"8","key":"666_CR39","doi-asserted-by":"publisher","first-page":"109924","DOI":"10.1016\/j.automatica.2021.109924","volume":"134","author":"D Jakoveti\u0107","year":"2021","unstructured":"Jakoveti\u0107, D., Kreji\u0107, N., Krklec Jerinki\u0107, N., Malaspina, G., Micheletti, A.: Distributed fixed point method for solving systems of linear algebraic equations. Automatica 134(8), 109924 (2021)","journal-title":"Automatica"},{"key":"666_CR40","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s10898-022-01221-4","volume":"85","author":"D Jakoveti\u0107","year":"2022","unstructured":"Jakoveti\u0107, D., Kreji\u0107, N., Krklec Jerinki\u0107, N.: EFIX: exact fixed point methods for distributed optimization. J. Global Optim. 85, 637\u2013661 (2022)","journal-title":"J. Global Optim."},{"unstructured":"Shi, G., Johansson, K.\u00a0H.: Finite-time and asymptotic convergence of distributed averaging and maximizing algorithms. arXiv:1205.1733, (2012)","key":"666_CR41"},{"issue":"1\u20132","key":"666_CR42","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0377-0427(00)00409-X","volume":"123","author":"A Fromer","year":"2000","unstructured":"Fromer, A., Szyld, D.: On asychronous iterations. J. Comput. Appl. Math. 123(1\u20132), 201\u2013216 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"666_CR43","volume-title":"Iterative solution of large linear systems","author":"DM Young","year":"1971","unstructured":"Young, D.M.: Iterative solution of large linear systems. Academic Press, Cambridge (1971)"},{"key":"666_CR44","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1090\/S0025-5718-01-01322-9","volume":"71","author":"N Kreji\u0107","year":"2002","unstructured":"Kreji\u0107, N., Lu\u017eanin, Z.: Newton-like method with modification of the right-hand side vector. Math. Comput. 71, 237\u2013250 (2002)","journal-title":"Math. Comput."},{"key":"666_CR45","first-page":"1","volume":"1","author":"L Xiao","year":"2006","unstructured":"Xiao, L., Boyd, S., Lall, S.: Distributed average consensus with time-varying metropolis weights. Automatica 1, 1\u20134 (2006)","journal-title":"Automatica"},{"issue":"8","key":"666_CR46","doi-asserted-by":"publisher","first-page":"3141","DOI":"10.1109\/TAC.2018.2880407","volume":"64","author":"AS Berahas","year":"2019","unstructured":"Berahas, A.S., Bollapragada, R., Keskar, N.S., Wei, E.: Balancing communication and computation in distributed optimization. IEEE Trans. Autom. Control 64(8), 3141\u20133155 (2019)","journal-title":"IEEE Trans. Autom. Control"},{"key":"666_CR47","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TNSRE.2013.2293575","volume":"22","author":"A Tsanas","year":"2014","unstructured":"Tsanas, A., Little, M.A., Fox, C., Ramig, L.O.: Objective automatic assessment of rehabilitative speech treatment in Parkinson\u2019s disease. IEEE Trans. Neural Syst. Rehabil. Eng. 22, 181\u2013190 (2014)","journal-title":"IEEE Trans. Neural Syst. Rehabil. Eng."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00666-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00666-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00666-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T12:32:21Z","timestamp":1747485141000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00666-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,26]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["666"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00666-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2025,2,26]]},"assertion":[{"value":"28 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}