{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T16:22:28Z","timestamp":1758126148048,"version":"3.37.3"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T00:00:00Z","timestamp":1715385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T00:00:00Z","timestamp":1715385600000},"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":["12371303","12101342"],"award-info":[{"award-number":["12371303","12101342"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10915-024-02550-0","type":"journal-article","created":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T05:01:57Z","timestamp":1715403717000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Proximal Alternating Direction Method of Multipliers for DC Programming with Structured Constraints"],"prefix":"10.1007","volume":"99","author":[{"given":"Yingxin","family":"Zhou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7672-4943","authenticated-orcid":false,"given":"Hongjin","family":"He","sequence":"additional","affiliation":[]},{"given":"Linan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,11]]},"reference":[{"issue":"1","key":"2550_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10107-017-1180-1","volume":"169","author":"F Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho, F., Fleming, R., Vuong, P.T.: Accelerating the DC algorithm for smooth functions. Math. Program. Ser. B 169(1), 95\u2013118 (2018)","journal-title":"Math. Program. Ser. B"},{"key":"2550_CR2","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1137\/18M123339X","volume":"30","author":"F Arag\u00f3n Artacho","year":"2020","unstructured":"Arag\u00f3n Artacho, F., Vuong, P.: The boosted difference of convex functions algorithm for nonsmooth functions. SIAM J. Optim. 30, 980\u20131006 (2020)","journal-title":"SIAM J. Optim."},{"key":"2550_CR3","doi-asserted-by":"crossref","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-Lojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"2550_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Space","author":"H Bauschke","year":"2011","unstructured":"Bauschke, H., Combettes, P.: Convex Analysis and Monotone Operator Theory in Hilbert Space. Springer, New York (2011)"},{"key":"2550_CR5","doi-asserted-by":"crossref","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 (2017)"},{"key":"2550_CR6","doi-asserted-by":"crossref","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. Ser. A 146, 459\u2013494 (2014)","journal-title":"Math. Program. Ser. A"},{"issue":"2","key":"2550_CR7","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1287\/moor.2019.1008","volume":"45","author":"RI Bo\u0163","year":"2020","unstructured":"Bo\u0163, R.I., Nguyen, D.K.: The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates. Math. Oper. Res. 45(2), 682\u2013712 (2020)","journal-title":"Math. Oper. Res."},{"key":"2550_CR8","doi-asserted-by":"crossref","first-page":"3932","DOI":"10.1073\/pnas.1517384113","volume":"113","author":"S Brunton","year":"2016","unstructured":"Brunton, S., Proctor, J., Kutz, J.: Discovering governing equations from data by sparse identification of nonlinear dynamical systems. Proc. Natl. Acad. Sci. 113, 3932\u20133937 (2016)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2550_CR9","first-page":"2313","volume":"35","author":"E Cand\u00e9s","year":"2007","unstructured":"Cand\u00e9s, E., Tao, T.: The Dantzig selector: statistical estimation when $$p$$ is much larger than $$n$$. Ann. Stat. 35, 2313\u20132351 (2007)","journal-title":"Ann. Stat."},{"key":"2550_CR10","doi-asserted-by":"crossref","first-page":"2116","DOI":"10.1016\/j.na.2011.10.012","volume":"75","author":"L Ceng","year":"2012","unstructured":"Ceng, L., Ansari, Q., Yao, J.: Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem. Nonlinear Anal. 75, 2116\u20132125 (2012)","journal-title":"Nonlinear Anal."},{"key":"2550_CR11","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02142692","volume":"8","author":"Y Censor","year":"1994","unstructured":"Censor, Y., Elfving, T.: A multiprojection algorithm using Bregman projections in product space. Numer. Algor. 8, 221\u2013239 (1994)","journal-title":"Numer. Algor."},{"key":"2550_CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10898-021-01079-y","volume":"82","author":"CS Chuang","year":"2022","unstructured":"Chuang, C.S., He, H., Zhang, Z.: A unified Douglas-Rachford algorithm for generalized DC programming. J. Global Optim. 82, 331\u2013349 (2022)","journal-title":"J. Global Optim."},{"key":"2550_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-4820-3","volume-title":"Functional Analysis, Calculus of Variations and Optimal Control","author":"F Clarke","year":"2013","unstructured":"Clarke, F.: Functional Analysis, Calculus of Variations and Optimal Control. Springer, London (2013)"},{"key":"2550_CR14","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"P Combettes","year":"2005","unstructured":"Combettes, P., Wajs, V.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"2550_CR15","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1137\/20M136517X","volume":"14","author":"H Ge","year":"2021","unstructured":"Ge, H., Chen, W., Ng, M.: New restricted isometry property analysis for $$\\ell _1-\\ell _2$$ minimization methods. SIAM J. Imaging Sci. 14, 530\u2013557 (2021)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"2550_CR16","doi-asserted-by":"crossref","first-page":"015006","DOI":"10.1088\/1361-6420\/ac39f8","volume":"38","author":"H Ge","year":"2021","unstructured":"Ge, H., Li, P.: The Dantzig selector: recovery of signal via $$\\ell _1-\\alpha \\ell _2$$ minimization. Inverse Probl. 38(1), 015006 (2021)","journal-title":"Inverse Probl."},{"key":"2550_CR17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-017-1181-0","volume":"169","author":"J Gotoh","year":"2018","unstructured":"Gotoh, J., Takeda, A., Tono, K.: DC formulations and algorithms for sparse optimization problems. Math. Program. Ser. B 169, 141\u2013176 (2018)","journal-title":"Math. Program. Ser. B"},{"issue":"8","key":"2550_CR18","doi-asserted-by":"crossref","first-page":"1653","DOI":"10.1080\/00207160.2016.1227432","volume":"94","author":"K Guo","year":"2017","unstructured":"Guo, K., Han, D., Wu, T.: Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints. Int. J. Comput. Math. 94(8), 1653\u20131669 (2017)","journal-title":"Int. J. Comput. Math."},{"key":"2550_CR19","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1023\/A:1004603514434","volume":"106","author":"BS He","year":"2000","unstructured":"He, B.S., Yang, H., Wang, S.: Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities. J. Optim. Theory Appl. 106, 337\u2013356 (2000)","journal-title":"J. Optim. Theory Appl."},{"key":"2550_CR20","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10915-015-0078-4","volume":"67","author":"H He","year":"2016","unstructured":"He, H., Ling, C., Xu, H.: An implementable splitting algorithm for the $$\\ell _1$$-norm regularized split feasibility problem. J. Sci. Comput. 67, 281\u2013298 (2016)","journal-title":"J. Sci. Comput."},{"key":"2550_CR21","doi-asserted-by":"crossref","first-page":"055003","DOI":"10.1088\/1361-6420\/aa5ec5","volume":"33","author":"H He","year":"2017","unstructured":"He, H., Xu, H.K.: Splitting methods for split feasibility problems with application to Dantzig selectors. Inverse Probl. 33, 055003 (2017)","journal-title":"Inverse Probl."},{"key":"2550_CR22","unstructured":"He, H., Zhang, Z.: A unified Bregman alternating minimization algorithm for generalized DC programming with applications to imaging data (2022). ArXiv:2209.07323"},{"key":"2550_CR23","doi-asserted-by":"crossref","first-page":"683890","DOI":"10.1155\/2012\/683890","volume":"2012","author":"S He","year":"2012","unstructured":"He, S., Zhu, W.: A note on approximating curve with $$\\ell _1$$-norm regularization method for the split feasibility problem. J. Appl. Math. 2012, 683890 (2012)","journal-title":"J. Appl. Math."},{"issue":"1","key":"2550_CR24","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1137\/140990309","volume":"26","author":"M Hong","year":"2016","unstructured":"Hong, M., Luo, Z.Q., Razaviyayn, M.: Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems. SIAM J. Optim. 26(1), 337\u2013364 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2550_CR25","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10589-018-0034-y","volume":"72","author":"B Jiang","year":"2019","unstructured":"Jiang, B., Lin, T., Ma, S., Zhang, S.: Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis. Comput. Optim. Appl. 72(1), 115\u2013157 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"2550_CR26","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"H Le Thi","year":"2018","unstructured":"Le Thi, H., Pham Dinh, T.: DC programming and DCA: thirty years of developments. Math. Program. Ser. A 169, 5\u201368 (2018)","journal-title":"Math. Program. Ser. A"},{"key":"2550_CR27","doi-asserted-by":"crossref","first-page":"76131","DOI":"10.1109\/ACCESS.2019.2914461","volume":"7","author":"Q Liu","year":"2019","unstructured":"Liu, Q., Shen, X., Gu, Y.: Linearized ADMM for nonconvex nonsmooth optimization with convergence analysis. IEEE Access 7, 76131\u201376144 (2019)","journal-title":"IEEE Access"},{"key":"2550_CR28","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1007\/s10915-017-0463-2","volume":"74","author":"Y Lou","year":"2018","unstructured":"Lou, Y., Yan, M.: Fast $$\\ell _1$$-$$\\ell _2$$ minimization via a proximal operator. J. Sci. Comput. 74, 767\u2013785 (2018)","journal-title":"J. Sci. Comput."},{"key":"2550_CR29","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10915-014-9930-1","volume":"64","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Yin, P., He, Q., Xin, J.: Computing sparse representation in a highly coherent dictionary based on difference of $$\\ell _1$$-$$\\ell _2$$. J. Sci. Comput. 64, 178\u2013196 (2015)","journal-title":"J. Sci. Comput."},{"key":"2550_CR30","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.1007\/s10915-016-0169-x","volume":"68","author":"Y Lou","year":"2016","unstructured":"Lou, Y., Yin, P., Xin, J.: Point source super-resolution via non-convex $$\\ell _1$$ based methods. J. Sci. Comput. 68, 1082\u20131100 (2016)","journal-title":"J. Sci. Comput."},{"key":"2550_CR31","doi-asserted-by":"crossref","first-page":"1798","DOI":"10.1137\/14098435X","volume":"8","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Zeng, T., Osher, S., Xin, J.: A weighted difference of anisotropic and isotropic total variation model for image processing. SIAM J. Imaging Sci. 8, 1798\u20131823 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"2550_CR32","doi-asserted-by":"crossref","first-page":"015011","DOI":"10.1088\/1361-6420\/ad0fad","volume":"40","author":"X Lu","year":"2024","unstructured":"Lu, X., Zhang, L., He, H.: Structured model selection via $$\\ell _1-\\ell _2$$ optimization. Inverse Probl. 40, 015011 (2024)","journal-title":"Inverse Probl."},{"key":"2550_CR33","doi-asserted-by":"crossref","first-page":"2725","DOI":"10.1137\/18M1214342","volume":"29","author":"Z Lu","year":"2019","unstructured":"Lu, Z., Zhou, Z.: Nonmonotone enhanced proximal DC algorithms for structured nonsmooth DC programming. SIAM J. Optim. 29, 2725\u20132752 (2019)","journal-title":"SIAM J. Optim."},{"key":"2550_CR34","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10107-018-1318-9","volume":"176","author":"Z Lu","year":"2019","unstructured":"Lu, Z., Zhou, Z., Sun, Z.: Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization. Math. Progr. Ser. B 176, 369\u2013401 (2019)","journal-title":"Math. Progr. Ser. B"},{"key":"2550_CR35","doi-asserted-by":"crossref","first-page":"1346","DOI":"10.1137\/16M1098929","volume":"10","author":"T Ma","year":"2017","unstructured":"Ma, T., Lou, Y., Huang, T.: Truncated $$\\ell _{1-2}$$ models for sparse recovery and rank minimization. SIAM J. Imaging Sci. 10, 1346\u20131380 (2017)","journal-title":"SIAM J. Imaging Sci."},{"key":"2550_CR36","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1007\/s11075-017-0398-6","volume":"78","author":"A Moudafi","year":"2018","unstructured":"Moudafi, A., Gibali, A.: $$\\ell _1$$-$$\\ell _2$$ regularization of split feasibility problems. Numer. Algor. 78, 739\u2013757 (2018)","journal-title":"Numer. Algor."},{"key":"2550_CR37","unstructured":"Nguyen, M.: DC programming and DCA for some classes of problems in machine learning and data mining. Ph.D. thesis, Universit\u00e9 de Lorraine (2014)"},{"key":"2550_CR38","unstructured":"Niu, Y.S.: On the convergence analysis of DCA. arXiv:2211.10942 (2022)"},{"key":"2550_CR39","doi-asserted-by":"crossref","unstructured":"Pham Dinh, T., Souad, E.B.: Algorithms for solving a class of nonconvex optimization problems. Methods of subgradients. In: J.B. Hiriart-Urruty (ed.) Fermat Days 85: Mathematics for Optimization, North-Holland Mathematics Studies, vol. 129, pp. 249 \u2013 271. North-Holland (1986)","DOI":"10.1016\/S0304-0208(08)72402-2"},{"key":"2550_CR40","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"2550_CR41","doi-asserted-by":"crossref","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-Verlag, Berlin (1998)"},{"key":"2550_CR42","doi-asserted-by":"crossref","first-page":"20160,446","DOI":"10.1098\/rspa.2016.0446","volume":"473","author":"H Schaeffer","year":"2017","unstructured":"Schaeffer, H.: Learning partial differential equations via data discovery and sparse optimization. Proc. R. Soc. A. 473, 20160,446 (2017)","journal-title":"Proc. R. Soc. A."},{"key":"2550_CR43","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1137\/18M1194730","volume":"18","author":"H Schaeffer","year":"2020","unstructured":"Schaeffer, H., Tran, G., Ward, R., Zhang, L.: Extracting structured dynamical systems using sparse optimization with very few samples. Multiscale Model. Simul. 18, 1435\u20131461 (2020)","journal-title":"Multiscale Model. Simul."},{"key":"2550_CR44","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s10444-017-9559-3","volume":"44","author":"T Sun","year":"2018","unstructured":"Sun, T., Yin, P., Cheng, L., Jiang, H.: Alternating direction method of multipliers with difference of convex functions. Adv. Comput. Math. 44, 723\u2013744 (2018)","journal-title":"Adv. Comput. Math."},{"issue":"3","key":"2550_CR45","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1109\/TSP.2016.2601299","volume":"65","author":"Y Sun","year":"2016","unstructured":"Sun, Y., Babu, P., Palomar, D.P.: Majorization-minimization algorithms in signal processing, communications, and machine learning. IEEE Trans. Signal Process. 65(3), 794\u2013816 (2016)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"2550_CR46","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1007\/s10589-022-00411-w","volume":"83","author":"S Takahashi","year":"2022","unstructured":"Takahashi, S., Fukuda, M., Tanaka, M.: New Bregman proximal type algorithms for solving DC optimization problems. Comput. Optim. Appl. 83(3), 893\u2013931 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"2550_CR47","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/s10898-019-00828-4","volume":"76","author":"K Tu","year":"2020","unstructured":"Tu, K., Zhang, H., Gao, H., Feng, J.: A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems. J. Global Optim. 76(4), 665\u2013693 (2020)","journal-title":"J. Global Optim."},{"key":"2550_CR48","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of ADMM in nonconvex nonsmooth optimization. J. Sci. Comput. 78, 29\u201363 (2019)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"2550_CR49","doi-asserted-by":"crossref","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."},{"key":"2550_CR50","doi-asserted-by":"crossref","first-page":"A536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of $$\\ell _{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37, A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"2550_CR51","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.4310\/CMS.2015.v13.n4.a10","volume":"13","author":"P Yin","year":"2015","unstructured":"Yin, P., Xin, J.: PhaseLiftOff: an accurate and stable phase retrieval method based on difference of trace and Frobenius norms. Commun. Math. Sci. 13, 1033\u20131049 (2015)","journal-title":"Commun. Math. Sci."},{"key":"2550_CR52","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1049\/iet-ipr.2017.0515","volume":"12","author":"F Zhang","year":"2018","unstructured":"Zhang, F., Yang, Z., Chen, Y., Yang, J., Yang, G.: Matrix completion via capped nuclear norm. IET Image Process. 12, 959\u2013966 (2018)","journal-title":"IET Image Process."},{"key":"2550_CR53","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/s11228-020-00566-w","volume":"28","author":"W de Oliveira","year":"2020","unstructured":"de Oliveira, W.: The ABC of DC programming. Set-Valued Var. Anal. 28, 679\u2013706 (2020)","journal-title":"Set-Valued Var. Anal."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02550-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02550-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02550-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T17:43:09Z","timestamp":1731951789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02550-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,11]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2550"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02550-0","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2024,5,11]]},"assertion":[{"value":"6 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2024","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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"89"}}