{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T07:02:06Z","timestamp":1773385326071,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T00:00:00Z","timestamp":1673827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T00:00:00Z","timestamp":1673827200000},"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":["12001455"],"award-info":[{"award-number":["12001455"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["20720190060"],"award-info":[{"award-number":["20720190060"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801088"],"award-info":[{"award-number":["11801088"]}],"id":[{"id":"10.13039\/501100001809","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":[[2023,5]]},"DOI":"10.1007\/s10589-023-00451-w","type":"journal-article","created":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T15:02:51Z","timestamp":1673881371000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An inexact Riemannian proximal gradient method"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8324-2416","authenticated-orcid":false,"given":"Wen","family":"Huang","sequence":"first","affiliation":[]},{"given":"Ke","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,16]]},"reference":[{"issue":"1","key":"451_CR1","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. Imaging Sci. 2(1), 183\u2013202 (2009). https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imaging Sci."},{"key":"451_CR2","doi-asserted-by":"publisher","unstructured":"Beck, A.: First-Order Methods in Optimization. Society for Industrial and Applied Mathematics, Philadelphia, PA (2017). https:\/\/doi.org\/10.1137\/1.9781611974997","DOI":"10.1137\/1.9781611974997"},{"key":"451_CR3","doi-asserted-by":"crossref","unstructured":"Darzentas, J.: Problem Complexity and Method Efficiency in Optimization (1983)","DOI":"10.2307\/2581380"},{"key":"451_CR4","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate $$O(1\/k^{2})$$. Dokl. Akas. Nauk SSSR (In Russian) 269, 543\u2013547 (1983)","journal-title":"Dokl. Akas. Nauk SSSR (In Russian)"},{"key":"451_CR5","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, 5\u201316 (2009)","journal-title":"Math. Program."},{"key":"451_CR6","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In: International Conference on Neural Information Processing Systems (2015)"},{"key":"451_CR7","doi-asserted-by":"crossref","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 59\u201399 (2016)","DOI":"10.1007\/s10107-015-0871-8"},{"issue":"46","key":"451_CR8","doi-asserted-by":"publisher","first-page":"18368","DOI":"10.1073\/pnas.1318679110","volume":"110","author":"V Ozolin\u0161","year":"2013","unstructured":"Ozolin\u0161, V., Lai, R., Caflisch, R., Osher, S.: Compressed modes for variational problems in mathematics and physics. Proc. Natl. Acad. Sci. 110(46), 18368\u201318373 (2013). https:\/\/doi.org\/10.1073\/pnas.1318679110","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"451_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H Zou","year":"2006","unstructured":"Zou, H., Hastie, T., Tibshirani, R.: Sparse principal component analysis. J. Comput. Graph. Stat. 15(2), 265\u2013286 (2006)","journal-title":"J. Comput. Graph. Stat."},{"key":"451_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2409","author":"W Huang","year":"2021","unstructured":"Huang, W., Wei, K.: An extension of fast iterative shrinkage-thresholding algorithm to Riemannian optimization for sparse principal component analysis. Numer. Linear Algebra Appl. (2021). https:\/\/doi.org\/10.1002\/nla.2409","journal-title":"Numer. Linear Algebra Appl."},{"issue":"12","key":"451_CR11","doi-asserted-by":"publisher","first-page":"5823","DOI":"10.1109\/TSP.2008.2006587","volume":"56","author":"MO Ulfarsson","year":"2008","unstructured":"Ulfarsson, M.O., Solo, V.: Sparse variable PCA using geodesic steepest descent. IEEE Trans. Signal Process. 56(12), 5823\u20135832 (2008). https:\/\/doi.org\/10.1109\/TSP.2008.2006587","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"451_CR12","doi-asserted-by":"publisher","first-page":"3074","DOI":"10.1214\/13-AOS1178","volume":"41","author":"TT Cai","year":"2013","unstructured":"Cai, T.T., Ma, Z., Wu, Y.: Sparse PCA: optimal rates and adaptive estimation. Ann. Stat. 41(6), 3074\u20133110 (2013). https:\/\/doi.org\/10.1214\/13-AOS1178","journal-title":"Ann. Stat."},{"key":"451_CR13","doi-asserted-by":"crossref","unstructured":"Xiao, N., Liu, X., Yuan, Y.: Exact penalty function for l2, 1 norm minimization over the Stiefel manifold. Optmization online (2020)","DOI":"10.1137\/20M1354313"},{"key":"451_CR14","unstructured":"Ye, J., Zhao, Z., Wu, M.: Discriminative k-means for clustering. In: Platt, J., Koller, D., Singer, Y., Roweis, S. (eds.) Advances in Neural Information Processing Systems, vol. 20. Curran Associates, Inc. (2008). https:\/\/proceedings.neurips.cc\/paper\/2007\/file\/a5cdd4aa0048b187f7182f1b9ce7a6a7-Paper.pdf"},{"key":"451_CR15","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-33715-4_35","volume-title":"Computer Vision\u2014ECCV 2012","author":"X Liang","year":"2012","unstructured":"Liang, X., Ren, X., Zhang, Z., Ma, Y.: Repairing sparse low-rank texture. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) Computer Vision\u2014ECCV 2012, pp. 482\u2013495. Springer, Berlin (2012)"},{"issue":"4","key":"451_CR16","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1080\/10618600.2017.1340891","volume":"26","author":"A Mishra","year":"2017","unstructured":"Mishra, A., Dey, D.K., Chen, K.: Sequential co-sparse factor regression. J. Comput. Graph. Stat. 26(4), 814\u2013825 (2017)","journal-title":"J. Comput. Graph. Stat."},{"key":"451_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ghanem, B., Liu, S., Xu, C., Ahuja, N.: Low-rank sparse coding for image classification. In: 2013 IEEE International Conference on Computer Vision, pp. 281\u2013288 (2013)","DOI":"10.1109\/ICCV.2013.42"},{"key":"451_CR18","doi-asserted-by":"publisher","unstructured":"Shi, J., Qi, C.: Low-rank sparse representation for single image super-resolution via self-similarity learning. In: 2016 IEEE International Conference on Image Processing (ICIP), pp. 1424\u20131428 (2016). https:\/\/doi.org\/10.1109\/ICIP.2016.7532593","DOI":"10.1109\/ICIP.2016.7532593"},{"issue":"1","key":"451_CR19","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/18M122457X","volume":"30","author":"S Chen","year":"2020","unstructured":"Chen, S., Ma, S., So, A.M.-C., Zhang, T.: Proximal gradient method for nonsmooth optimization over the Stiefel manifold. SIAM J. Optim. 30(1), 210\u2013239 (2020). https:\/\/doi.org\/10.1137\/18M122457X","journal-title":"SIAM J. Optim."},{"key":"451_CR20","doi-asserted-by":"publisher","unstructured":"Huang, W., Wei, K.: Riemannian proximal gradient methods. Math. Program. (2021). https:\/\/doi.org\/10.1007\/s10107-021-01632-3. Published online https:\/\/doi.org\/10.1007\/s10107-021-01632-3","DOI":"10.1007\/s10107-021-01632-3 10.1007\/s10107-021-01632-3"},{"issue":"502","key":"451_CR21","volume":"107","author":"OY Le","year":"2020","unstructured":"Le, O.Y., Zhang, X.F., Yan, H.: Sparse regularized low-rank tensor regression with applications in genomic data analysis. Pattern Recogn. 107(502), 107516 (2020)","journal-title":"Pattern Recogn."},{"key":"451_CR22","first-page":"2911","volume":"15","author":"C-J Hsieh","year":"2014","unstructured":"Hsieh, C.-J., Sustik, M., Dhillon, I., Ravikumar, P.: QUIC: quadratic approximation for sparse inverse covariance estimation. J. Mach. Learn. Res. 15, 2911\u20132947 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"5\u20136","key":"451_CR23","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1080\/02331930412331327157","volume":"53","author":"PL Combettes","year":"2004","unstructured":"Combettes, P.L.: Solving monotone inclusions via compositions of nonexpansive averaged operators. Optimization 53(5\u20136), 475\u2013504 (2004). https:\/\/doi.org\/10.1080\/02331930412331327157","journal-title":"Optimization"},{"issue":"3","key":"451_CR24","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/TIP.2010.2072512","volume":"20","author":"JM Fadili","year":"2011","unstructured":"Fadili, J.M., Peyr\u00e9, G.: Total variation projection with first order schemes. IEEE Trans. Image Process. 20(3), 657\u2013669 (2011). https:\/\/doi.org\/10.1109\/TIP.2010.2072512","journal-title":"IEEE Trans. Image Process."},{"key":"451_CR25","unstructured":"Schmidt, M., Roux, N., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Shawe-Taylor, J., Zemel, R., Bartlett, P., Pereira, F., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 24. Curran Associates, Inc. (2011). https:\/\/proceedings.neurips.cc\/paper\/2011\/file\/8f7d807e1f53eff5f9efbe5cb81090fb-Paper.pdf"},{"issue":"3","key":"451_CR26","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":"4","key":"451_CR27","doi-asserted-by":"publisher","first-page":"3069","DOI":"10.1137\/19M1254155","volume":"30","author":"S Bonettini","year":"2020","unstructured":"Bonettini, S., Prato, M., Rebegoldi, S.: Convergence of inexact forward-backward algorithms using the forward-backward envelope. SIAM J. Optim. 30(4), 3069\u20133097 (2020). https:\/\/doi.org\/10.1137\/19M1254155","journal-title":"SIAM J. Optim."},{"key":"451_CR28","volume-title":"An Introduction to Differentiable Manifolds and Riemannian Geometry","author":"WM Boothby","year":"1986","unstructured":"Boothby, W.M.: An Introduction to Differentiable Manifolds and Riemannian Geometry, 2nd edn. Academic Press, Cambridge (1986)","edition":"2"},{"key":"451_CR29","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"P-A Absil","year":"2008","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008)"},{"issue":"1","key":"451_CR30","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/16M1108145","volume":"28","author":"S Hosseini","year":"2018","unstructured":"Hosseini, S., Huang, W., Yousefpour, R.: Line search algorithms for locally Lipschitz functions on Riemannian manifolds. SIAM J. Optim. 28(1), 596\u2013619 (2018)","journal-title":"SIAM J. Optim."},{"key":"451_CR31","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91755-9","volume-title":"Introduction to Riemannian Manifolds","author":"JM Lee","year":"2018","unstructured":"Lee, J.M.: Introduction to Riemannian Manifolds. Graduate Texts in Mathematics, vol. 176, 2nd edn. Springer, Berlin (2018)","edition":"2"},{"key":"451_CR32","doi-asserted-by":"crossref","unstructured":"do Carmo, M.P.: Riemannian Geometry. Mathematics: Theory & Applications (1992)","DOI":"10.1007\/978-1-4757-2201-7"},{"issue":"5","key":"451_CR33","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1137\/0314056","journal-title":"SIAM J. Control. Optim."},{"issue":"1","key":"451_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/drx080","volume":"39","author":"N Boumal","year":"2018","unstructured":"Boumal, N., Absil, P.-A., Cartis, C.: Global rates of convergence for nonconvex optimization on manifolds. IMA J. Numer. Anal. 39(1), 1\u201333 (2018). https:\/\/doi.org\/10.1093\/imanum\/drx080","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"451_CR35","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\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010). https:\/\/doi.org\/10.1287\/moor.1100.0449","journal-title":"Math. Oper. Res."},{"key":"451_CR36","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.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"451_CR37","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":"451_CR38","doi-asserted-by":"publisher","first-page":"763","DOI":"10.2307\/2661354","volume":"152","author":"K Kurdyka","year":"2000","unstructured":"Kurdyka, K., Mostowski, T., Adam, P.: Proof of the gradient conjecture of r. thom. Ann. Math. 152, 763\u2013792 (2000)","journal-title":"Ann. Math."},{"key":"451_CR39","unstructured":"Bento, G.C., de Cruz\u00a0Neto, J.X., Oliveira, P.R.: Convergence of inexact descent methods for nonconvex optimization on Riemannian manifold. arXiv preprint arXiv:1103.4828 (2011)"},{"key":"451_CR40","doi-asserted-by":"crossref","unstructured":"Qian, Y., Pan, S., Xiao, L.: Error bound and exact penalty method for optimization problems with nonnegative orthogonal constraint (2022)","DOI":"10.1093\/imanum\/drac084"},{"key":"451_CR41","unstructured":"Huang, W., Wei, K.: Riemannian Proximal Gradient Methods (extended version). arXiv:1909.06065 (2019)"},{"issue":"2","key":"451_CR42","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1137\/050624509","volume":"28","author":"H Qi","year":"2006","unstructured":"Qi, H., Sun, D.: A quadratically convergent newton method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28(2), 360\u2013385 (2006). https:\/\/doi.org\/10.1137\/050624509","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"451_CR43","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X-Y Zhao","year":"2010","unstructured":"Zhao, X.-Y., Sun, D., Toh, K.-C.: A newton-cg augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010). https:\/\/doi.org\/10.1137\/080718206","journal-title":"SIAM J. Optim."},{"issue":"1","key":"451_CR44","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/s10915-017-0624-3","volume":"76","author":"X Xiao","year":"2018","unstructured":"Xiao, X., Li, Y., Wen, Z., Zhang, L.: A regularized semi-smooth Newton method with projection steps for composite convex programs. J. Sci. Comput. 76(1), 364\u2013389 (2018). https:\/\/doi.org\/10.1007\/s10915-017-0624-3","journal-title":"J. Sci. Comput."},{"key":"451_CR45","doi-asserted-by":"crossref","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Classics in Applied Mathematics of SIAM (1990)","DOI":"10.1137\/1.9781611971309"},{"key":"451_CR46","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117, 387\u2013423 (2009). https:\/\/doi.org\/10.1007\/s10107-007-0170-0","journal-title":"Math. Program."},{"issue":"2","key":"451_CR47","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10107-016-1100-9","volume":"165","author":"Z Zhou","year":"2017","unstructured":"Zhou, Z., So, M.C.: A unified approach to error bounds for structured convex optimization problems. Math. Program. 165(2), 689\u2013728 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"451_CR48","doi-asserted-by":"publisher","first-page":"1660","DOI":"10.1137\/140955483","volume":"25","author":"W Huang","year":"2015","unstructured":"Huang, W., Gallivan, K.A., Absil, P.-A.: A Broyden class of quasi-Newton methods for Riemannian optimization. SIAM J. Optim. 25(3), 1660\u20131685 (2015). https:\/\/doi.org\/10.1137\/140955483","journal-title":"SIAM J. Optim."},{"issue":"2","key":"451_CR49","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-014-0765-1","volume":"150","author":"W Huang","year":"2015","unstructured":"Huang, W., Absil, P.-A., Gallivan, K.A.: A Riemannian symmetric rank-one trust-region method. Math. Program. 150(2), 179\u2013216 (2015)","journal-title":"Math. Program."},{"key":"451_CR50","unstructured":"Boumal, N.: An Introduction to Optimization on Smooth Manifolds. Available online http:\/\/www.nicolasboumal.net\/book (2020)"},{"issue":"44","key":"451_CR51","first-page":"43","volume":"4","author":"W Huang","year":"2018","unstructured":"Huang, W., Absil, P.-A., Gallivan, K.A., Hand, P.: ROPTLIB: an object-oriented C++ library for optimization on Riemannian manifolds. ACM Trans. Math. Softw. 4(44), 43\u201314321 (2018)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"451_CR52","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1198\/1061860032148","volume":"12","author":"IT Jolliffe","year":"2003","unstructured":"Jolliffe, I.T., Trendafilov, N.T., Uddin, M.: A modified principal component technique based on the Lasso. J. Comput. Graph. Stat. 12(3), 531\u2013547 (2003)","journal-title":"J. Comput. Graph. Stat."},{"issue":"2","key":"451_CR53","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s00211-016-0848-4","volume":"136","author":"W Huang","year":"2016","unstructured":"Huang, W., Absil, P.-A., Gallivan, K.A.: Intrinsic representation of tangent vectors and vector transport on matrix manifolds. Numer. Math. 136(2), 523\u2013543 (2016). https:\/\/doi.org\/10.1007\/s00211-016-0848-4","journal-title":"Numer. Math."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00451-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00451-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00451-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T16:46:45Z","timestamp":1680713205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00451-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,16]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["451"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00451-w","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,16]]},"assertion":[{"value":"10 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2023","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 there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}