{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T14:04:53Z","timestamp":1772633093929,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"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":["12271181"],"award-info":[{"award-number":["12271181"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangzhou Basic Research Program","award":["2025A04J5240"],"award-info":[{"award-number":["2025A04J5240"]}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2023A1515030046"],"award-info":[{"award-number":["2023A1515030046"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["12471098"],"award-info":[{"award-number":["12471098"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Province Key Laboratory of Computational Science at the Sun Yat-sen University","award":["2020B1212060032"],"award-info":[{"award-number":["2020B1212060032"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10915-026-03190-2","type":"journal-article","created":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T03:36:15Z","timestamp":1770608175000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems"],"prefix":"10.1007","volume":"106","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7015-5502","authenticated-orcid":false,"given":"Junpeng","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0271-4619","authenticated-orcid":false,"given":"Na","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9667-6026","authenticated-orcid":false,"given":"Qia","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,9]]},"reference":[{"issue":"1\u20132","key":"3190_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1\u20132), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"3190_CR2","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"3190_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"3190_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"3190_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-order Methods in Optimization. SIAM, Philadelphia, PA (2017)"},{"issue":"1","key":"3190_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/B:JOTA.0000026129.07165.5a","volume":"121","author":"H Benson","year":"2004","unstructured":"Benson, H.: On the global optimization of sums of linear fractional functions over a convex set. J. Optim. Theory Appl. 121(1), 19\u201339 (2004)","journal-title":"J. Optim. Theory Appl."},{"key":"3190_CR7","unstructured":"Bertsekas, D.: Convex Optimization Theory, vol.\u00a01. Athena Scientific (2009)"},{"key":"3190_CR8","doi-asserted-by":"crossref","unstructured":"Bian, W., Chen, X.: Nonsmooth convex-concave saddle point problems with cardinality penalties. Mathematical Programming pp. 1\u201347 (2024)","DOI":"10.1007\/s10107-024-02123-x"},{"issue":"8","key":"3190_CR9","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1080\/02331934.2017.1294592","volume":"66","author":"RI Bo\u0163","year":"2017","unstructured":"Bo\u0163, R.I., Csetnek, E.R.: Proximal-gradient algorithms for fractional programming. Optimization 66(8), 1383\u20131396 (2017)","journal-title":"Optimization"},{"issue":"3","key":"3190_CR10","doi-asserted-by":"publisher","first-page":"2415","DOI":"10.1287\/moor.2021.1214","volume":"47","author":"RI Bo\u0163","year":"2022","unstructured":"Bo\u0163, R.I., Dao, M.N., Li, G.: Extrapolated proximal subgradient algorithms for nonconvex and nonsmooth fractional programs. Math. Oper. Res. 47(3), 2415\u20132443 (2022)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"3190_CR11","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1137\/22M1472000","volume":"33","author":"RI Bo\u0163","year":"2023","unstructured":"Bo\u0163, R.I., Dao, M.N., Li, G.: Inertial proximal block coordinate method for a class of nonsmooth sum-of-ratios optimization problems. SIAM J. Optim. 33(2), 361\u2013393 (2023)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"3190_CR12","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A., Shiota, M.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2), 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"3190_CR13","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"3190_CR14","unstructured":"Clarke, F.H., Ledyaev, Y.S., Stern, R.J., Wolenski, P.R.: Nonsmooth analysis and control theory, vol. 178. Springer Science & Business Media (2008)"},{"key":"3190_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF00941314","volume":"47","author":"J Crouzeix","year":"1985","unstructured":"Crouzeix, J., Ferland, J., Schaible, S.: An algorithm for generalized fractional programs. J. Optim. Theory Appl. 47, 35\u201349 (1985)","journal-title":"J. Optim. Theory Appl."},{"key":"3190_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976748","volume-title":"Modern Nonconvex Nondifferentiable Optimization","author":"Y Cui","year":"2021","unstructured":"Cui, Y., Pang, J.S.: Modern Nonconvex Nondifferentiable Optimization. Society for Industrial and Applied Mathematics, Philadelphia, PA (2021)"},{"issue":"3","key":"3190_CR17","doi-asserted-by":"publisher","first-page":"2883","DOI":"10.1137\/22M1535243","volume":"34","author":"YH Dai","year":"2024","unstructured":"Dai, Y.H., Wang, J., Zhang, L.: Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems. SIAM J. Optim. 34(3), 2883\u20132916 (2024)","journal-title":"SIAM J. Optim."},{"issue":"7","key":"3190_CR18","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W Dinkelbach","year":"1967","unstructured":"Dinkelbach, W.: On nonlinear fractional programming. Manage. Sci. 13(7), 492\u2013498 (1967)","journal-title":"Manage. Sci."},{"issue":"1","key":"3190_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10898-024-01383-3","volume":"90","author":"J He","year":"2024","unstructured":"He, J., Zhang, H., Xu, Z.: An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms. J. Global Optim. 90(1), 73\u201392 (2024)","journal-title":"J. Global Optim."},{"key":"3190_CR20","unstructured":"Huang, L., Jia, J., Yu, B., Chun, B.G., Maniatis, P., Naik, M.: Predicting execution time of computer programs using sparse polynomial regression. In: Proceedings of the 24th International Conference on Neural Information Processing Systems - Volume 1, NIPS\u201910, p. 883\u2013891. Curran Associates Inc., Red Hook, NY, USA (2010)"},{"issue":"3","key":"3190_CR21","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02591871","volume":"26","author":"T Ibaraki","year":"1983","unstructured":"Ibaraki, T.: Parametric approaches to fractional programs. Math. Program. 26(3), 345\u2013362 (1983)","journal-title":"Math. Program."},{"issue":"3","key":"3190_CR22","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1137\/22M1482238","volume":"5","author":"J Jiang","year":"2023","unstructured":"Jiang, J., Chen, X.: Optimality conditions for nonsmooth nonconvex-nonconcave min-max problems and generative adversarial networks. SIAM Journal on Mathematics of Data Science 5(3), 693\u2013722 (2023)","journal-title":"SIAM Journal on Mathematics of Data Science"},{"key":"3190_CR23","unstructured":"Jin, C., Netrapalli, P., Jordan, M.: What is local optimality in nonconvex-nonconcave minimax optimization? In: Proceedings of the 37th International Conference on Machine Learning, pp. 4880\u20134889. PMLR (2020)"},{"issue":"4","key":"3190_CR24","doi-asserted-by":"publisher","first-page":"2558","DOI":"10.1137\/20M1313222","volume":"31","author":"W Kong","year":"2021","unstructured":"Kong, W., Monteiro, R.D.C.: An accelerated inexact proximal point method for solving nonconvex-concave min-max problems. SIAM J. Optim. 31(4), 2558\u20132585 (2021)","journal-title":"SIAM J. Optim."},{"key":"3190_CR25","unstructured":"Li, J., Zhu, L., So, A.M.C.: Nonsmooth composite nonconvex-concave minimax optimization. In: OPT 2022: Optimization for Machine Learning (NeurIPS 2022 Workshop) (2022)"},{"key":"3190_CR26","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.acha.2021.08.004","volume":"56","author":"Q Li","year":"2022","unstructured":"Li, Q., Shen, L., Zhang, N., Zhou, J.: A proximal algorithm with backtracked extrapolation for a class of structured fractional programming. Appl. Comput. Harmon. Anal. 56, 98\u2013122 (2022)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"3190_CR27","doi-asserted-by":"publisher","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."},{"key":"3190_CR28","doi-asserted-by":"publisher","first-page":"3676","DOI":"10.1109\/TSP.2020.2986363","volume":"68","author":"S Lu","year":"2020","unstructured":"Lu, S., Tsaknakis, I., Hong, M., Chen, Y.: Hybrid block successive approximation for one-sided non-convex min-max problems: Algorithms and applications. IEEE Trans. Signal Process. 68, 3676\u20133691 (2020)","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"3190_CR29","doi-asserted-by":"publisher","first-page":"2930","DOI":"10.1137\/16M1110182","volume":"55","author":"Z Lu","year":"2017","unstructured":"Lu, Z., Xiao, L.: A randomized nonmonotone block proximal gradient method for a class of structured nonlinear programming. SIAM J. Numer. Anal. 55(6), 2930\u20132955 (2017)","journal-title":"SIAM J. Numer. Anal."},{"key":"3190_CR30","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation I: Basic Theory, vol. 330. Springer Science & Business Media (2006)"},{"issue":"5\u20136","key":"3190_CR31","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1080\/02331930600816395","volume":"55","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S., Nam, N.M., Yen, N.: Fr\u00e9chet subdifferential calculus and optimality conditions in nondifferentiable programming. Optimization 55(5\u20136), 685\u2013708 (2006)","journal-title":"Optimization"},{"issue":"6","key":"3190_CR32","doi-asserted-by":"publisher","first-page":"A3649","DOI":"10.1137\/18M123147X","volume":"41","author":"Y Rahimi","year":"2019","unstructured":"Rahimi, Y., Wang, C., Dong, H., Lou, Y.: A scale-invariant approach for sparse signal recovery. SIAM J. Sci. Comput. 41(6), A3649\u2013A3672 (2019)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"3190_CR33","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan, M.: The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J. Optim. 7(1), 26\u201333 (1997)","journal-title":"SIAM J. Optim."},{"key":"3190_CR34","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, NJ (1970)"},{"key":"3190_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, New York, NY (1998)"},{"issue":"4","key":"3190_CR36","first-page":"653","volume":"3","author":"S Sabach","year":"2018","unstructured":"Sabach, S., Teboulle, M., Voldman, S.: A smoothing alternating minimization-based algorithm for clustering with sum-min of euclidean norms. Pure and Applied Functional Analysis 3(4), 653\u2013679 (2018)","journal-title":"Pure and Applied Functional Analysis"},{"key":"3190_CR37","doi-asserted-by":"crossref","unstructured":"Schaible, S.: Fractional programming. II, on Dinkelbach\u2019s algorithm. Management Science 22(8), 868\u2013873 (1976)","DOI":"10.1287\/mnsc.22.8.868"},{"issue":"10","key":"3190_CR38","doi-asserted-by":"publisher","first-page":"2616","DOI":"10.1109\/TSP.2018.2812733","volume":"66","author":"K Shen","year":"2018","unstructured":"Shen, K., Yu, W.: Fractional programming for communication systems\u2014part i: Power control and beamforming. IEEE Trans. Signal Process. 66(10), 2616\u20132630 (2018)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"3190_CR39","doi-asserted-by":"publisher","first-page":"A770","DOI":"10.1137\/20M136801X","volume":"44","author":"M Tao","year":"2022","unstructured":"Tao, M.: Minimization of $$l_1$$ over $$l_2$$ for sparse signal recovery with convergence guarantee. SIAM J. Sci. Comput. 44(2), A770\u2013A797 (2022)","journal-title":"SIAM J. Sci. Comput."},{"key":"3190_CR40","doi-asserted-by":"crossref","unstructured":"Wang, C., Aujol, J.F., Gilboa, G., Lou, Y.: Minimizing quotient regularization model. Inverse Problems and Imaging pp. 1\u201319 (2024)","DOI":"10.3934\/ipi.2024041"},{"issue":"2","key":"3190_CR41","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1137\/20M1341490","volume":"14","author":"C Wang","year":"2021","unstructured":"Wang, C., Tao, M., Nagy, J.G., Lou, Y.: Limited-angle CT reconstruction via the $$l_1\/l_2$$ minimization. SIAM J. Imag. Sci. 14(2), 749\u2013777 (2021)","journal-title":"SIAM J. Imag. Sci."},{"key":"3190_CR42","doi-asserted-by":"publisher","first-page":"2660","DOI":"10.1109\/TSP.2020.2985298","volume":"68","author":"C Wang","year":"2020","unstructured":"Wang, C., Yan, M., Rahimi, Y., Lou, Y.: Accelerated schemes for the $$l_1\/l_2$$ minimization. IEEE Trans. Signal Process. 68, 2660\u20132669 (2020)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"3190_CR43","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10589-017-9954-1","volume":"69","author":"B Wen","year":"2018","unstructured":"Wen, B., Chen, X., Pong, T.K.: A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 69(2), 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"7","key":"3190_CR44","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"3190_CR45","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imag. Sci. 6(3), 1758\u20131789 (2013)","journal-title":"SIAM J. Imag. Sci."},{"key":"3190_CR46","doi-asserted-by":"publisher","first-page":"87","DOI":"10.4310\/CIS.2014.v14.n2.a2","volume":"14","author":"P Yin","year":"2014","unstructured":"Yin, P., Esser, E., Xin, J.: Ratio and difference of $$l_1$$ and $$l_2$$ norms and sparse representation with coherent dictionaries. Commun. Inf. Syst. 14, 87\u2013109 (2014)","journal-title":"Commun. Inf. Syst."},{"issue":"2","key":"3190_CR47","doi-asserted-by":"publisher","first-page":"1576","DOI":"10.1137\/20M1355380","volume":"31","author":"L Zeng","year":"2021","unstructured":"Zeng, L., Yu, P., Pong, T.K.: Analysis and algorithms for some compressed sensing models based on $$l_1\/l_2$$ minimization. SIAM J. Optim. 31(2), 1576\u20131603 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"3190_CR48","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1137\/20M1325381","volume":"32","author":"N Zhang","year":"2022","unstructured":"Zhang, N., Li, Q.: First-order algorithms for a class of fractional optimization problems. SIAM J. Optim. 32(1), 100\u2013129 (2022)","journal-title":"SIAM J. Optim."},{"key":"3190_CR49","doi-asserted-by":"crossref","unstructured":"Zhang, N., Liu, X., Li, Q.: Parameterized proximal-gradient algorithms for L1\/L2 sparse signal recovery. Applied and Computational Harmonic Analysis p. 101835 (2025)","DOI":"10.1016\/j.acha.2025.101835"},{"issue":"4","key":"3190_CR50","doi-asserted-by":"publisher","first-page":"3010","DOI":"10.1287\/moor.2024.0457","volume":"50","author":"J Zhou","year":"2025","unstructured":"Zhou, J., Zhang, N., Li, Q.: An equivalent reformulation and multiproximity gradient algorithms for a class of nonsmooth fractional programming. Math. Oper. Res. 50(4), 3010\u20133038 (2025)","journal-title":"Math. Oper. Res."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03190-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-026-03190-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03190-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T07:14:47Z","timestamp":1772608487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-026-03190-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,9]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["3190"],"URL":"https:\/\/doi.org\/10.1007\/s10915-026-03190-2","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,9]]},"assertion":[{"value":"28 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","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":"72"}}