{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T05:05:18Z","timestamp":1724907918642},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T00:00:00Z","timestamp":1629417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T00:00:00Z","timestamp":1629417600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PGC2018-097960-B-C22"],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DE200100063"],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["PGC2018-097960-B-C22"],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","award":["PGC2018-097960-B-C22"]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["PGC2018-097960-B-C22"],"id":[{"id":"10.13039\/501100008530","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":[[2021,11]]},"DOI":"10.1007\/s10589-021-00291-6","type":"journal-article","created":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T09:03:11Z","timestamp":1629450191000},"page":"549-585","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Strengthened splitting methods for computing resolvents"],"prefix":"10.1007","volume":"80","author":[{"given":"Francisco J.","family":"Arag\u00f3n Artacho","sequence":"first","affiliation":[]},{"given":"Rub\u00e9n","family":"Campoy","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3654-6553","authenticated-orcid":false,"given":"Matthew K.","family":"Tam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,20]]},"reference":[{"issue":"3","key":"291_CR1","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1007\/s00245-019-09599-6","volume":"80","author":"S Adly","year":"2019","unstructured":"Adly, S., Bourdin, L.: On a decomposition formula for the resolvent operator of the sum of two set-valued maps with monotonicity assumptions. Appl. Math. Optim. 80(3), 715\u2013732 (2019)","journal-title":"Appl. Math. Optim."},{"issue":"2","key":"291_CR2","first-page":"699","volume":"26","author":"S Adly","year":"2019","unstructured":"Adly, S., Bourdin, L., Caubet, F.: On the proximity operator of the sum of two closed and convex functions. J. Conv. Anal. 26(2), 699\u2013718 (2019)","journal-title":"J. Conv. Anal."},{"issue":"6","key":"291_CR3","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/j.orl.2018.10.003","volume":"46","author":"S Alwadani","year":"2018","unstructured":"Alwadani, S., Bauschke, H.H., Moursi, W.M., Wang, X.: On the asymptotic behaviour of the Arag\u00f3n Artacho-Campoy algorithm. Oper. Res. Lett. 46(6), 585\u2013587 (2018)","journal-title":"Oper. Res. Lett."},{"key":"291_CR4","doi-asserted-by":"crossref","unstructured":"Attouch, H., Buttazzo, G., Michaille, G.: Variational Analysis in Sobolev and BV Spaces: Applications to PDEs and Optimization. Society for Industrial and Applied Mathematics (2014)","DOI":"10.1137\/1.9781611973488"},{"key":"291_CR5","first-page":"299","volume":"55","author":"FJ Arag\u00f3n Artacho","year":"2014","unstructured":"Arag\u00f3n Artacho, F.J., Borwein, J.M., Tam, M.K.: Douglas-Rachford feasibility methods for matrix completion problems. ANZIAM J. 55, 299\u2013326 (2014)","journal-title":"ANZIAM J."},{"issue":"1","key":"291_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10589-017-9942-5","volume":"69","author":"FJ Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho, F.J., Campoy, R.: A new projection method for finding the closest point in the intersection of convex sets. Comput. Optim. Appl. 69(1), 99\u2013132 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"291_CR7","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s10957-019-01481-3","volume":"181","author":"FJ Arag\u00f3n Artacho","year":"2019","unstructured":"Arag\u00f3n Artacho, F.J., Campoy, R.: Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm. J. Optim. Theory Appl. 181(3), 709\u2013726 (2019)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"291_CR8","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s11075-018-0608-x","volume":"82","author":"FJ Arag\u00f3n Artacho","year":"2019","unstructured":"Arag\u00f3n Artacho, F.J., Campoy, R.: Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces. Numer. Algo. 82(2), 397\u2013421 (2019)","journal-title":"Numer. Algo."},{"issue":"2","key":"291_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s00186-019-00691-9","volume":"91","author":"FJ Arag\u00f3n Artacho","year":"2020","unstructured":"Arag\u00f3n Artacho, F.J., Campoy, R., Tam, M.K.: The Douglas-Rachford algorithm for convex and nonconvex feasibility problems. Math. Methods Oper. Res. 91(2), 201\u2013240 (2020)","journal-title":"Math. Methods Oper. Res."},{"key":"291_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"key":"291_CR11","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1137\/130924214","volume":"52","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H.H., Hare, W.L., Moursi, W.M.: Generalized solutions for the sum of two maximally monotone operators. SIAM J. Control Optim. 52, 1034\u20131047 (2014)","journal-title":"SIAM J. Control Optim."},{"key":"291_CR12","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Moursi, W.M. (2017). On the Douglas\u2013Rachford algorithm. Math. Program. Ser. A 164(1\u20132), 263\u2013284","DOI":"10.1007\/s10107-016-1086-3"},{"key":"291_CR13","doi-asserted-by":"publisher","unstructured":"Bauschke, H.H., Moursi, W.M., Wang, X.: Generalized monotone operators and their averaged resolvents. Program Math. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01500-6","DOI":"10.1007\/s10107-020-01500-6"},{"key":"291_CR14","doi-asserted-by":"crossref","unstructured":"Bauschke, H. H., Singh, S., & Wang, X. (2021). Projecting onto rectangular matrices with prescribed row and column sums. arXiv preprint arXiv:2105.12222","DOI":"10.1186\/s13663-021-00708-1"},{"key":"291_CR15","unstructured":"Bauschke, H. H., Wang, X., & Yao, L. (2010). General resolvents for monotone operators: characterization and extension. In: Biomedical Mathematics: Promising Directions in Imaging, Therapy Planning and Inverse Problems. Medical Physics Publishing"},{"key":"291_CR16","doi-asserted-by":"crossref","unstructured":"Berman, A., Plemmons, R. J. (1994). Nonnegative matrices in the mathematical sciences. Soc. Indus. Appl. Math","DOI":"10.1137\/1.9781611971262"},{"issue":"3","key":"291_CR17","doi-asserted-by":"crossref","first-page":"034005","DOI":"10.1088\/1361-6420\/ab460a","volume":"36","author":"C Bertocchi","year":"2020","unstructured":"Bertocchi, C., Chouzenoux, E., Corbineau, M.C., Pesquet, J.C., Prato, M.: Deep unfolding of a proximal interior point method for image restoration. Inverse Problems 36(3), 034005 (2020)","journal-title":"Inverse Problems"},{"issue":"8","key":"291_CR18","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.1080\/02331934.2017.1294592","volume":"66","author":"RI Bot","year":"2017","unstructured":"Bot, R.I., Csetnek, E.R.: Proximal-gradient algorithms for fractional programming. Optimization 66(8), 1383\u20131396 (2017)","journal-title":"Optimization"},{"key":"291_CR19","unstructured":"Bot, R. I., Dao, M. N., & Li, G. (2020). Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs. arXiv preprint arXiv:2003.04124"},{"key":"291_CR20","doi-asserted-by":"crossref","unstructured":"Boyle, J. P., & Dykstra, R. L. (1986). A method for finding projections onto the intersection of convex sets in Hilbert spaces. In: Advances in Order Restricted Statistical Inference (pp. 28-47). Springer, New York, NY","DOI":"10.1007\/978-1-4613-9940-7_3"},{"key":"291_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-70914-7","volume-title":"Functional Analysis. Sobolev Spaces and Partial Differential Equations. Universitext","author":"H Brezis","year":"2011","unstructured":"Brezis, H.: Functional Analysis. Sobolev Spaces and Partial Differential Equations. Universitext. Springer, New York (2011)"},{"issue":"6","key":"291_CR22","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.1090\/S0002-9939-04-07844-X","volume":"133","author":"RS Burachik","year":"2005","unstructured":"Burachik, R.S., Jeyakumar, V.: A simple closure condition for the normal cone intersection formula. Proc. Am. Math. Soc. 133(6), 1741\u20131748 (2005)","journal-title":"Proc. Am. Math. Soc."},{"key":"291_CR23","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s11228-020-00542-4","volume":"29","author":"V Cevher","year":"2021","unstructured":"Cevher, V., Vu, B.C.: A reflected forward-backward splitting method for monotone inclusions involving Lipschitzian operators. Set Valued Var. Anal. 29, 163\u2013174 (2021)","journal-title":"Set Valued Var. Anal."},{"key":"291_CR24","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imag. Vis. 40, 120\u2013145 (2011)","journal-title":"J. Math. Imag. Vis."},{"issue":"2","key":"291_CR25","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/S1052623495290179","volume":"7","author":"GH Chen","year":"1997","unstructured":"Chen, G.H., Rockafellar, R.T.: Convergence rates in forward-backward splitting. SIAM J. Optim. 7(2), 421\u2013444 (1997)","journal-title":"SIAM J. Optim."},{"key":"291_CR26","doi-asserted-by":"crossref","unstructured":"Chen, B., & Tang, Y. (2019). Iterative methods for computing the resolvent of the sum of a maximal monotone operator and composite operator with applications. Math. Probl. Eng., 7376263","DOI":"10.1155\/2019\/7376263"},{"key":"291_CR27","unstructured":"Chierchia, G., Chouzenoux, E., Combettes, P. L., & Pesquet, J.-C. The Proximity Operator Repository. User\u2019s guide http:\/\/proximity-operator.net\/download\/guide.pdf. Accessed 6 July 2020"},{"issue":"4","key":"291_CR28","first-page":"727","volume":"16","author":"PL Combettes","year":"2009","unstructured":"Combettes, P.L.: Iterative construction of the resolvent of a sum of maximal monotone operators. J. Conv. Anal. 16(4), 727\u2013748 (2009)","journal-title":"J. Conv. Anal."},{"key":"291_CR29","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/s00245-019-09597-8","volume":"80","author":"ER Csetnek","year":"2019","unstructured":"Csetnek, E.R., Malitsky, Y., Tam, M.K.: Shadow Douglas-Rachford splitting for monotone inclusions. Appl. Math. Optim. 80, 665\u2013678 (2019)","journal-title":"Appl. Math. Optim."},{"issue":"4","key":"291_CR30","doi-asserted-by":"crossref","first-page":"2697","DOI":"10.1137\/18M121160X","volume":"29","author":"MN Dao","year":"2019","unstructured":"Dao, M.N., Phan, H.M.: Adaptive Douglas-Rachford splitting algorithm for the sum of two operators. SIAM J. Optim. 29(4), 2697\u20132724 (2019)","journal-title":"SIAM J. Optim."},{"key":"291_CR31","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1007\/s11590-019-01432-x","volume":"14","author":"MN Dao","year":"2020","unstructured":"Dao, M.N., Phan, H.M.: Computing the resolvent of the sum of operators with application to best approximation problems. Optim. Lett. 14, 1193\u20131205 (2020)","journal-title":"Optim. Lett."},{"issue":"4","key":"291_CR32","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1007\/s11228-017-0421-z","volume":"25","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications. Set Valued Var. Anal. 25(4), 829\u2013858 (2017)","journal-title":"Set Valued Var. Anal."},{"issue":"1\u20133","key":"291_CR33","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55(1\u20133), 293\u2013318 (1992)","journal-title":"Math. Program."},{"issue":"4","key":"291_CR34","doi-asserted-by":"crossref","first-page":"2241","DOI":"10.1007\/s11784-017-0417-1","volume":"19","author":"P Giselsson","year":"2017","unstructured":"Giselsson, P.: Tight global linear convergence rate bounds for Douglas-Rachford splitting. J. Fixed Point Theory Appl. 19(4), 2241\u20132270 (2017)","journal-title":"J. Fixed Point Theory Appl."},{"key":"291_CR35","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(88)90223-6","volume":"103","author":"NJ Higham","year":"1988","unstructured":"Higham, N.J.: Computing a nearest symmetric positive semidefinite matrix. Linear Alg. Appl. 103, 103\u2013118 (1988)","journal-title":"Linear Alg. Appl."},{"key":"291_CR36","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01565-3","author":"PR Johnstone","year":"2020","unstructured":"Johnstone, P.R., Eckstein, J.: Projective splitting with forward steps. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01565-3","journal-title":"Math. Program."},{"key":"291_CR37","first-page":"747","volume":"12","author":"GM Korpelevich","year":"1976","unstructured":"Korpelevich, G.M.: The extragradient method for finding saddle points and other problems. Ekonomika i Matematicheskie Metody 12, 747\u2013756 (1976)","journal-title":"Ekonomika i Matematicheskie Metody"},{"issue":"2","key":"291_CR38","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s11228-017-0418-7","volume":"26","author":"F Lauster","year":"2018","unstructured":"Lauster, F., Luke, D.R., Tam, M.K.: Symbolic computation with monotone operators. Set Valued Var. Anal. 26(2), 353\u2013368 (2018)","journal-title":"Set Valued Var. Anal."},{"key":"291_CR39","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10107-019-01416-w","volume":"184","author":"Y Malitsky","year":"2020","unstructured":"Malitsky, Y.: Golden ratio algorithms for variational inequalities. Math. Program. 184, 383\u2013410 (2020)","journal-title":"Math. Program."},{"issue":"2","key":"291_CR40","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1137\/18M1207260","volume":"30","author":"Y Malitsky","year":"2020","unstructured":"Malitsky, Y., Tam, M.K.: A forward-backward splitting method for monotone inclusions without cocoercivity. SIAM J. Optim. 30(2), 1451\u20131472 (2020)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"291_CR41","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1215\/S0012-7094-62-02933-2","volume":"29","author":"GJ Minty","year":"1962","unstructured":"Minty, G.J.: Monotone (nonlinear) operators in Hilbert space. Duke Math. J. 29(3), 341\u2013346 (1962)","journal-title":"Duke Math. J."},{"key":"291_CR42","unstructured":"Moreau, J.J.: Fonctions convexes duales et points proximaux dans un espace hilbertien. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences de Paris A255(22), 2897\u20132899 (1962)"},{"issue":"3","key":"291_CR43","doi-asserted-by":"crossref","first-page":"87","DOI":"10.4067\/S0719-06462014000300007","volume":"16","author":"A Moudafi","year":"2014","unstructured":"Moudafi, A.: Computing the resolvent of composite operators. Cubo (Temuco) 16(3), 87\u201396 (2014)","journal-title":"Cubo (Temuco)"},{"issue":"3","key":"291_CR44","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"issue":"1","key":"291_CR45","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/BF02612715","volume":"28","author":"G Pierra","year":"1984","unstructured":"Pierra, G.: Decomposition through formalization in a product space. Math. Program. 28(1), 96\u2013115 (1984)","journal-title":"Math. Program."},{"issue":"5","key":"291_CR46","first-page":"845","volume":"28","author":"LD Popov","year":"1980","unstructured":"Popov, L.D.: A modification of the Arrow-Hurwicz method for search of saddle points. Math. Notes Acad. Sci. USSR 28(5), 845\u2013848 (1980)","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"291_CR47","first-page":"125248","volume":"381","author":"J Rieger","year":"2020","unstructured":"Rieger, J., Tam, M.K.: Backward-forward-reflected-backward splitting for three operator monotone inclusions. Appl. Math. Comput. 381, 125248 (2020)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"291_CR48","first-page":"397","volume":"18","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Monotone operators associated with saddle-functions and minimax problems. Nonlinear Funct. Anal. 18(1), 397\u2013407 (1970)","journal-title":"Nonlinear Funct. Anal."},{"key":"291_CR49","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1972)"},{"issue":"5","key":"291_CR50","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"issue":"1\u20134","key":"291_CR51","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Physica D Nonlinear Phen. 60(1\u20134), 259\u2013268 (1992)","journal-title":"Physica D Nonlinear Phen."},{"key":"291_CR52","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10107-019-01403-1","volume":"182","author":"EK Ryu","year":"2020","unstructured":"Ryu, E.K.: Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting. Math. Program. 182, 233\u2013273 (2020)","journal-title":"Math. Program."},{"issue":"3","key":"291_CR53","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1007\/s10957-019-01601-z","volume":"184","author":"EK Ryu","year":"2020","unstructured":"Ryu, E.K., Vu, B.C.: Finding the forward-Douglas-Rachford-forward method. J. Optim. Theory Appl. 184(3), 858\u2013876 (2020)","journal-title":"J. Optim. Theory Appl."},{"key":"291_CR54","doi-asserted-by":"crossref","unstructured":"Takouda, P.L.: Un probl\u00e9me d\u2019approximation matricielle: quelle est la matrice bistochastique la plus proche d\u2019une matrice donn\u00e9e? RAIRO-Operations Research-Recherche Op\u00e9rationnelle 39(1), 35\u201354 (2005)","DOI":"10.1051\/ro:2005003"},{"issue":"2","key":"291_CR55","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Control Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00291-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00291-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00291-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T18:47:56Z","timestamp":1673117276000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00291-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,20]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["291"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00291-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,20]]},"assertion":[{"value":"2 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2021","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"}},{"value":"For access to the code, please contact the corresponding author","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}