{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:26:52Z","timestamp":1773271612902,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T00:00:00Z","timestamp":1746662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["405349\/2021-1"],"award-info":[{"award-number":["405349\/2021-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["304133\/2021-3"],"award-info":[{"award-number":["304133\/2021-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["312223\/2022-6"],"award-info":[{"award-number":["312223\/2022-6"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS - 2307328"],"award-info":[{"award-number":["DMS - 2307328"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10957-025-02684-7","type":"journal-article","created":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T14:37:11Z","timestamp":1746715031000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Relative Inexact Proximal Gradient Method with an Explicit Linesearch"],"prefix":"10.1007","volume":"206","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7877-5688","authenticated-orcid":false,"given":"Yunier","family":"Bello-Cruz","sequence":"first","affiliation":[]},{"given":"Max L. N.","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]},{"given":"Jefferson G.","family":"Melo","sequence":"additional","affiliation":[]},{"given":"Cassandra","family":"Mohr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,8]]},"reference":[{"issue":"2","key":"2684_CR1","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/s10957-019-01525-8","volume":"182","author":"VA Adona","year":"2019","unstructured":"Adona, V.A., Gon\u00e7alves, M.L.N., Melo, J.G.: A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis. J. Optim. Theory Appl. 182(2), 640\u2013666 (2019). https:\/\/doi.org\/10.1007\/s10957-019-01525-8","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2684_CR2","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/s10589-020-00191-1","volume":"76","author":"VA Adona","year":"2020","unstructured":"Adona, V.A., Gon\u00e7alves, M.L.N., Melo, J.G.: An inexact proximal generalized alternating direction method of multipliers. Comput. Optim. Appl. 76(3), 621\u2013647 (2020). https:\/\/doi.org\/10.1007\/s10589-020-00191-1","journal-title":"Comput. Optim. Appl."},{"key":"2684_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01584842","volume":"81","author":"YI Alber","year":"1998","unstructured":"Alber, Y.I., Iusem, A.N., Solodov, M.V.: On the projected subgradient method for nonsmooth convex optimization in a Hilbert space. Math. Program. 81, 23\u201335 (1998). https:\/\/doi.org\/10.1007\/BF01584842","journal-title":"Math. Program."},{"issue":"2","key":"2684_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10589-019-00165-y","volume":"75","author":"MM Alves","year":"2020","unstructured":"Alves, M.M., Eckstein, J., Geremia, M., Melo, J.G.: Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms. Comput. Optim. Appl. 75(2), 389\u2013422 (2020). https:\/\/doi.org\/10.1007\/s10589-019-00165-y","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"2684_CR5","doi-asserted-by":"publisher","first-page":"2408","DOI":"10.1137\/140994964","volume":"25","author":"JF Aujol","year":"2015","unstructured":"Aujol, J.F., Dossal, C.: Stability of over-relaxations for the forward-backward algorithm, application to FISTA. SIAM J. Optim. 25(4), 2408\u20132433 (2015). https:\/\/doi.org\/10.1137\/140994964","journal-title":"SIAM J. Optim."},{"key":"2684_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5802\/ojmo.12","volume":"3","author":"M Barr\u00e9","year":"2022","unstructured":"Barr\u00e9, M., Taylor, A., Bach, F.: A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives. Open J. Math. Optim. 3, 1\u201315 (2022). https:\/\/doi.org\/10.5802\/ojmo.12","journal-title":"Open J. Math. Optim."},{"key":"2684_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10898-021-01057-4","volume":"82","author":"S Bartz","year":"2022","unstructured":"Bartz, S., Dao, M.N., Phan, H.M.: Conical averagedness and convergence analysis of fixed point algorithms. J. Global Optim. 82, 351\u2013373 (2022). https:\/\/doi.org\/10.1007\/s10898-021-01057-4","journal-title":"J. Global Optim."},{"issue":"3","key":"2684_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3), 367\u2013426 (1996). https:\/\/doi.org\/10.1137\/S0036144593251710","journal-title":"SIAM Rev."},{"issue":"3","key":"2684_CR9","first-page":"382","volume":"4","author":"HH Bauschke","year":"2008","unstructured":"Bauschke, H.H., Combettes, P.L.: A Dykstra-like algorithm for two monotone operators. Pac. J. Optim. 4(3), 382\u2013391 (2008)","journal-title":"Pac. J. Optim."},{"issue":"1","key":"2684_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009). https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imag. Sci."},{"issue":"2","key":"2684_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s11228-016-0376-5","volume":"25","author":"JY Bello Cruz","year":"2017","unstructured":"Bello Cruz, J.Y.: On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions. Set-Valued Var. Anal. 25(2), 245\u2013263 (2017). https:\/\/doi.org\/10.1007\/s11228-016-0376-5","journal-title":"Set-Valued Var. Anal."},{"issue":"2","key":"2684_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/01630563.2015.1080271","volume":"37","author":"JY Bello Cruz","year":"2016","unstructured":"Bello Cruz, J.Y., de Oliveira, W.: On weak and strong convergence of the projected gradient method for convex optimization in real Hilbert spaces. Numer. Funct. Anal. Optim. 37(2), 129\u2013144 (2016). https:\/\/doi.org\/10.1080\/01630563.2015.1080271","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"2","key":"2684_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10589-022-00421-8","volume":"84","author":"Y Bello-Cruz","year":"2023","unstructured":"Bello-Cruz, Y., Gon\u00e7alves, M.L.N., Krislock, N.: On FISTA with a relative error rule. Comput. Optim. Appl. 84(2), 295\u2013318 (2023). https:\/\/doi.org\/10.1007\/s10589-022-00421-8","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"2684_CR14","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1080\/10556788.2016.1214959","volume":"31","author":"JY Bello Cruz","year":"2016","unstructured":"Bello Cruz, J.Y., Nghia, T.T.A.: On the convergence of the forward-backward splitting method with linesearches. Optim. Methods Softw. 31(6), 1209\u20131238 (2016). https:\/\/doi.org\/10.1080\/10556788.2016.1214959","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"2684_CR15","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/s10957-020-01787-7","volume":"188","author":"Y Bello-Cruz","year":"2021","unstructured":"Bello-Cruz, Y., Li, G., Nghia, T.T.A.: On the linear convergence of forward-backward splitting method: Part I-convergence analysis. J. Optim. Theory Appl. 188(2), 378\u2013401 (2021). https:\/\/doi.org\/10.1007\/s10957-020-01787-7","journal-title":"J. Optim. Theory Appl."},{"key":"2684_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10957-022-02013-2","volume":"194","author":"Y Bello Cruz","year":"2022","unstructured":"Bello Cruz, Y., Li, G., Nghia, T.T.A.: Quadratic growth conditions and uniqueness of optimal solution to Lasso. J. Optim. Theory Appl. 194, 167\u2013190 (2022). https:\/\/doi.org\/10.1007\/s10957-022-02013-2","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2684_CR17","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/s10851-011-0324-9","volume":"44","author":"S Bonettini","year":"2012","unstructured":"Bonettini, S., Ruggiero, V.: On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration. J. Math. Imaging Vision 44(3), 236\u2013253 (2012). https:\/\/doi.org\/10.1007\/s10851-011-0324-9","journal-title":"J. Math. Imaging Vision"},{"issue":"2","key":"2684_CR18","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1137\/15M1019325","volume":"26","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Loris, I., Porta, F., Prato, M.: Variable metric inexact line-search-based methods for nonsmooth optimization. SIAM J. Optim. 26(2), 891\u2013921 (2016). https:\/\/doi.org\/10.1137\/15M1019325","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2684_CR19","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/25\/1\/015005","volume":"25","author":"K Bredies","year":"2009","unstructured":"Bredies, K.: A forward-backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space. Inverse Probl. 25(1), 015005 (2009). https:\/\/doi.org\/10.1088\/0266-5611\/25\/1\/015005","journal-title":"Inverse Probl."},{"key":"2684_CR20","unstructured":"Cano, A., Masegosa, A., Moral, S.: ELVIRA biomedical data set repository. Available at https:\/\/leo.ugr.es\/elvira\/DBCRepository\/ (2005)"},{"key":"2684_CR21","doi-asserted-by":"publisher","first-page":"2032","DOI":"10.1214\/aos\/1176348385","volume":"19","author":"I Csisz\u00e1r","year":"1991","unstructured":"Csisz\u00e1r, I.: Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems. Ann. Stat. 19, 2032\u20132066 (1991). https:\/\/doi.org\/10.1214\/aos\/1176348385","journal-title":"Ann. Stat."},{"issue":"4","key":"2684_CR22","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005). https:\/\/doi.org\/10.1137\/050626090","journal-title":"Multiscale Model. Simul."},{"issue":"1","key":"2684_CR23","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-012-0528-9","volume":"141","author":"J Eckstein","year":"2013","unstructured":"Eckstein, J., Silva, P.J.S.: A practical relative error criterion for augmented Lagrangians. Math. Program. 141(1), 319\u2013348 (2013). https:\/\/doi.org\/10.1007\/s10107-012-0528-9","journal-title":"Math. Program."},{"issue":"2","key":"2684_CR24","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10589-017-9911-z","volume":"68","author":"J Eckstein","year":"2017","unstructured":"Eckstein, J., Yao, W.: Approximate ADMM algorithms derived from lagrangian splitting. Comput. Optim. Appl. 68(2), 363\u2013405 (2017). https:\/\/doi.org\/10.1007\/s10589-017-9911-z","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2684_CR25","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1137\/110847081","volume":"170","author":"J Eckstein","year":"2018","unstructured":"Eckstein, J., Yao, W.: Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM. Math. Program. 170(2), 417\u2013444 (2018). https:\/\/doi.org\/10.1137\/110847081","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2684_CR26","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q. 3(1\u20132), 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Q."},{"key":"2684_CR27","unstructured":"Guyon, I.: UCI machine learning repository. Available at http:\/\/www.causality.inf.ethz.ch\/data\/CINA.html (2004)"},{"key":"2684_CR28","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms II. Grundlehren Der Mathematischen Wissenschaften 306. Springer-Verlag, Berlin (1993)","DOI":"10.1007\/978-3-662-02796-7"},{"key":"2684_CR29","unstructured":"Jaggi, M.: Revisiting Frank-Wolfe: projection-free sparse convex optimization. In Proceedings of the 30th International Conference on Machine Learning, PMLR, pp 427\u2013435 (2013)"},{"issue":"3","key":"2684_CR30","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1137\/110847081","volume":"22","author":"K Jiang","year":"2012","unstructured":"Jiang, K., Sun, D., Toh, K.-c: An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP. SIAM J. Optim. 22(3), 1042\u20131064 (2012). https:\/\/doi.org\/10.1137\/110847081","journal-title":"SIAM J. Optim."},{"key":"2684_CR31","first-page":"747","volume":"12","author":"GM Korpelevich","year":"1976","unstructured":"Korpelevich, G.M.: The extragradient method for finding saddle points and other problems. Ekon. Mat. Metody 12, 747\u2013756 (1976)","journal-title":"Ekon. Mat. Metody"},{"key":"2684_CR32","doi-asserted-by":"publisher","first-page":"2681","DOI":"10.5555\/1953048.2078191","volume":"12","author":"J Mairal","year":"2011","unstructured":"Mairal, J., Jenatton, R., Obozinski, G., Bach, F.: Convex and network flow optimization for structured sparsity. J. Mach. Learn. Res. 12, 2681\u20132720 (2011). https:\/\/doi.org\/10.5555\/1953048.2078191","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"2684_CR33","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1007\/s10898-019-00808-8","volume":"75","author":"RD Millan","year":"2019","unstructured":"Millan, R.D., Machado, M.P.: Inexact proximal $$\\epsilon $$-subgradient methods for composite convex optimization problems. J. Global Optim. 75(4), 1029\u20131060 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00808-8","journal-title":"J. Global Optim."},{"issue":"6","key":"2684_CR34","doi-asserted-by":"publisher","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RDC Monteiro","year":"2010","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean. SIAM J. Optim. 20(6), 2755\u20132787 (2010). https:\/\/doi.org\/10.1137\/090753127","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2684_CR35","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2014). https:\/\/doi.org\/10.1561\/2400000003","journal-title":"Found. Trends Optim."},{"issue":"4","key":"2684_CR36","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1137\/16M1073741","volume":"27","author":"S Salzo","year":"2017","unstructured":"Salzo, S.: The variable metric forward-backward splitting algorithm under mild differentiability assumptions. SIAM J. Optim. 27(4), 2153\u20132181 (2017). https:\/\/doi.org\/10.1137\/16M1073741","journal-title":"SIAM J. Optim."},{"issue":"12","key":"2684_CR37","doi-asserted-by":"publisher","first-page":"2855","DOI":"10.1162\/NECO_a_00672","volume":"26","author":"S Salzo","year":"2014","unstructured":"Salzo, S., Masecchia, S., Verri, A., Barla, A.: Alternating proximal regularized dictionary learning. Neural Comput. 26(12), 2855\u20132895 (2014). https:\/\/doi.org\/10.1162\/NECO_a_00672","journal-title":"Neural Comput."},{"issue":"4","key":"2684_CR38","first-page":"1167","volume":"19","author":"S Salzo","year":"2012","unstructured":"Salzo, S., Villa, S.: Inexact and accelerated proximal point algorithms. J. Convex Anal. 19(4), 1167\u20131192 (2012)","journal-title":"J. Convex Anal."},{"key":"2684_CR39","unstructured":"Schmidt, M., Roux, N.L., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. In Proceedings of the 24th International Conference on Neural Information Processing Systems (NIPS\u201911), Red Hook, NY, USA, Curran Associates Inc., pp 1458\u20131466 (2011)"},{"key":"2684_CR40","doi-asserted-by":"publisher","DOI":"10.1515\/9783110255720","volume-title":"Regularization Methods in Banach Spaces","author":"T Schuster","year":"2012","unstructured":"Schuster, T., Kaltenbacher, B., Hofmann, B., Kazimierski, K.S.: Regularization Methods in Banach Spaces. De Gruyter, Berlin (2012)"},{"issue":"4","key":"2684_CR41","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1008777829180","volume":"7","author":"MV Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Anal. 7(4), 323\u2013345 (1999). https:\/\/doi.org\/10.1023\/A:1008777829180","journal-title":"Set-Valued Anal."},{"key":"2684_CR42","unstructured":"Team, C.: A marketing dataset. Available at http:\/\/www.causality.inf.ethz.ch\/data\/CINA.html (2008)"},{"issue":"2","key":"2684_CR43","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0363012998338806","volume":"38","author":"P Tseng","year":"2000","unstructured":"Tseng, P.: A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control Optim. 38(2), 431\u2013446 (2000). https:\/\/doi.org\/10.1137\/S0363012998338806","journal-title":"SIAM J. Control Optim."},{"issue":"386","key":"2684_CR44","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2288030","volume":"80","author":"Y Vardi","year":"1985","unstructured":"Vardi, Y., Shepp, L.A., Kaufman, L.: A statistical model for positron emission tomography. J. Am. Stat. Assoc. 80(386), 8\u201337 (1985). https:\/\/doi.org\/10.2307\/2288030","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"2684_CR45","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward-backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2013). https:\/\/doi.org\/10.1137\/110844805","journal-title":"SIAM J. Optim."},{"issue":"9","key":"2684_CR46","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1109\/TNNLS.2012.2200262","volume":"23","author":"LW Zhong","year":"2012","unstructured":"Zhong, L.W., Kwok, J.T.: Efficient sparse modeling with automatic feature grouping. IEEE Trans. Neural Netw. Learn. Syst. 23(9), 1436\u20131447 (2012). https:\/\/doi.org\/10.1109\/TNNLS.2012.2200262","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"2684_CR47","unstructured":"Zhou, Q., Pan, S.J.: Convergence analysis of linear coupling with inexact proximal operator. In Proceedings of the Thirty-Eighth Conference on Uncertainty in Artificial Intelligence, PMLR, pp 2394\u20132403 (2022)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02684-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02684-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02684-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T13:51:36Z","timestamp":1748613096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02684-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,8]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2684"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02684-7","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,8]]},"assertion":[{"value":"16 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 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 declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"9"}}