{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:42Z","timestamp":1740124002721,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T00:00:00Z","timestamp":1638230400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T00:00:00Z","timestamp":1638230400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100013269","name":"Lund Center for Control of Complex Engineering Systems","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013269","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001729","name":"Stiftelsen f\u00f6r Strategisk Forskning","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001729","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["621-2012-5357"],"award-info":[{"award-number":["621-2012-5357"]}],"id":[{"id":"10.13039\/501100004359","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":[[2022,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Low-rank inducing unitarily invariant norms have been introduced to convexify problems with a low-rank\/sparsity constraint. The most well-known member of this family is the so-called nuclear norm. To solve optimization problems involving such norms with proximal splitting methods, efficient ways of evaluating the proximal mapping of the low-rank inducing norms are needed. This is known for the nuclear norm, but not for most other members of the low-rank inducing family. This work supplies a framework that reduces the proximal mapping evaluation into a nested binary search, in which each iteration requires the solution of a much simpler problem. The simpler problem can often be solved analytically as demonstrated for the so-called low-rank inducing Frobenius and spectral norms. The framework also allows to compute the proximal mapping of increasing convex functions composed with these norms as well as projections onto their epigraphs.<\/jats:p>","DOI":"10.1007\/s10957-021-01956-2","type":"journal-article","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T18:58:19Z","timestamp":1638298699000},"page":"168-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Proximal Mapping Computation for Low-Rank Inducing Norms"],"prefix":"10.1007","volume":"192","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2437-3154","authenticated-orcid":false,"given":"Christian","family":"Grussler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pontus","family":"Giselsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,30]]},"reference":[{"issue":"8","key":"1956_CR1","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.1007\/s11590-017-1146-5","volume":"11","author":"F Andersson","year":"2017","unstructured":"Andersson, F., Carlsson, M., Olsson, C.: Convex envelopes for fixed rank approximation. Optim. Lett. 11(8), 1783\u20131795 (2017). https:\/\/doi.org\/10.1007\/s11590-017-1146-5","journal-title":"Optim. Lett."},{"key":"1956_CR2","series-title":"Systems and Linear Algebra: Three Decades of Algebraic Systems Theory","first-page":"17","volume-title":"Operators","author":"AC Antoulas","year":"2013","unstructured":"Antoulas, A.C.: On the approximation of Hankel matrices. In: Helmke, U. (ed.) Operators. Systems and Linear Algebra: Three Decades of Algebraic Systems Theory, pp. 17\u201322. Vieweg+Teubner Verlag, Wiesbaden (2013)"},{"key":"1956_CR3","first-page":"1457","volume-title":"Advances in Neural Information Processing Systems","author":"A Argyriou","year":"2012","unstructured":"Argyriou, A., Foygel, R., Srebro, N.: Sparse prediction with the k-support norm. In: Pereira, F., Burges, C.J.C., Bottou, L., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 25, pp. 1457\u20131465. Curran Associates Inc, London (2012)"},{"key":"1956_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-3-319-48311-5"},{"key":"1956_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004). https:\/\/doi.org\/10.1017\/CBO9780511804441"},{"issue":"6","key":"1956_CR6","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Plan, Y.: Matrix completion with noise. Proc. IEEE 98(6), 925\u2013936 (2010). https:\/\/doi.org\/10.1109\/JPROC.2009.2035722","journal-title":"Proc. IEEE"},{"issue":"6","key":"1956_CR7","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717 (2009). https:\/\/doi.org\/10.1007\/s10208-009-9045-5","journal-title":"Found. Comput. Math."},{"issue":"6","key":"1956_CR8","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10208-012-9135-7","volume":"12","author":"V Chandrasekaran","year":"2012","unstructured":"Chandrasekaran, V., Recht, B., Parrilo, P.A., Willsky, A.S.: The convex geometry of linear inverse problems. Found. Comput. Math. 12(6), 805\u2013849 (2012). https:\/\/doi.org\/10.1007\/s10208-012-9135-7","journal-title":"Found. Comput. Math."},{"key":"1956_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-1-4419-9569-8_10","volume-title":"Proximal Splitting Methods in Signal Processing","author":"PL Combettes","year":"2011","unstructured":"Combettes, P.L., Pesquet, J.-C.: Proximal Splitting Methods in Signal Processing, pp. 185\u2013212. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4419-9569-8_10"},{"issue":"1","key":"1956_CR10","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10107-015-0946-6","volume":"158","author":"L Condat","year":"2016","unstructured":"Condat, L.: Fast projection onto the simplex and the $$\\ell _1$$ ball. Math. Program. 158(1), 575\u2013585 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0946-6","journal-title":"Math. Program."},{"issue":"2","key":"1956_CR11","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas, J., Rachford, H.H.: On the numerical solution of heat conduction problems in two and three space variables. Trans. Am. Math. Soc. 82(2), 421\u2013439 (1956)","journal-title":"Trans. Am. Math. Soc."},{"key":"1956_CR12","doi-asserted-by":"publisher","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., Chandra, T.: Efficient projections onto the L1-ball for learning in high dimensions. In: ICML \u201908: Proceedings of the 25th International Conference on Machine Learning, 25th International Conference on Machine Learning (ICML), pp. 272\u2013279, New York (2008). https:\/\/doi.org\/10.1145\/1390156.1390191","DOI":"10.1145\/1390156.1390191"},{"key":"1956_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718867","author":"L Eld\u00e9n","year":"2007","unstructured":"Eld\u00e9n, L.: Matrix methods in data mining and pattern recognition. SIAM (2007). https:\/\/doi.org\/10.1137\/1.9780898718867","journal-title":"SIAM"},{"key":"1956_CR14","doi-asserted-by":"crossref","unstructured":"Eriksson, A., Thanh Pham, T., Chin, T.-J., Reid, I.: The k-support norm and convex envelopes of cardinality and rank. In: 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3349\u20133357(2015)","DOI":"10.1109\/CVPR.2015.7298956"},{"key":"1956_CR15","doi-asserted-by":"publisher","unstructured":"Fazel, M., Hindi, H.., Boyd, S.P.: A rank minimization heuristic with application to minimum order system approximation. In: Proceedings of the 2001 American Control Conference, vol\u00a06, pp. 4734\u20134739 (2001). https:\/\/doi.org\/10.1109\/ACC.2001.945730","DOI":"10.1109\/ACC.2001.945730"},{"key":"1956_CR16","doi-asserted-by":"publisher","unstructured":"Grussler, C., Giselsson, P.: Local convergence of proximal splitting methods for rank constrained problems. In: 2017 IEEE 56th Annual Conference on Decision and Control (CDC), pp. 702\u2013708. Melbourne (2017). https:\/\/doi.org\/10.1109\/CDC.2017.8263743","DOI":"10.1109\/CDC.2017.8263743"},{"issue":"4","key":"1956_CR17","doi-asserted-by":"publisher","first-page":"3057","DOI":"10.1137\/17M1115770","volume":"28","author":"C Grussler","year":"2018","unstructured":"Grussler, C., Giselsson, P.: Low-rank inducing norms with optimality interpretations. SIAM J. Optim. 28(4), 3057\u20133078 (2018). https:\/\/doi.org\/10.1137\/17M1115770","journal-title":"SIAM J. Optim."},{"key":"1956_CR18","doi-asserted-by":"publisher","unstructured":"Grussler, C., Zare, A., Jovanovi\u0107, M.R., Rantzer, A.: The use of the $$r\\ast $$ heuristic in covariance completion problems. In|: 2016 IEEE 55th Conference on Decision and Control (CDC), pp. 1978\u20131983. Las Vegas (2016). https:\/\/doi.org\/10.1109\/CDC.2016.7798554","DOI":"10.1109\/CDC.2016.7798554"},{"issue":"11","key":"1956_CR19","doi-asserted-by":"publisher","first-page":"4000","DOI":"10.1109\/TAC.2018.2813009","volume":"63","author":"C Grussler","year":"2018","unstructured":"Grussler, C., Rantzer, A., Giselsson, P.: Low-rank optimization with convex constraints. IEEE Trans. Autom. Control 63(11), 4000\u20134007 (2018). https:\/\/doi.org\/10.1109\/TAC.2018.2813009","journal-title":"IEEE Trans. Autom. Control"},{"key":"1956_CR20","unstructured":"Grussler, C.: LRINorm\u2014A MATLAB package for rank constrained optimization by low-rank inducing norms and non-convex proximal splitting methods. https:\/\/github.com\/LowRankOpt\/LRINorm (2018a)"},{"key":"1956_CR21","unstructured":"Grussler, C.: LRIPy\u2014a python package for rank constrained optimization by low-rank inducing norms and non-convex proximal splitting methods. https:\/\/github.com\/LowRankOpt\/LRIPy (2018b)"},{"issue":"1","key":"1956_CR22","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M Held","year":"1974","unstructured":"Held, M., Wolfe, P., Crowder, H.P.: Validation of subgradient optimization. Math. Program. 6(1), 62\u201388 (1974). https:\/\/doi.org\/10.1007\/BF01580223","journal-title":"Math. Program."},{"key":"1956_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-06409-2","volume-title":", onvex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods. Grundlehren der mathematischen Wissenschaften","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: , onvex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods. Grundlehren der mathematischen Wissenschaften. Springer, Berlin Heidelberg (1993). https:\/\/doi.org\/10.1007\/978-3-662-06409-2"},{"key":"1956_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms I: Fundamentals. Grundlehren der mathematischen Wissenschaften","author":"J-B Hiriart-Urruty","year":"1996","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I: Fundamentals. Grundlehren der mathematischen Wissenschaften. Springer, Berlin, Heidelberg (1996). https:\/\/doi.org\/10.1007\/978-3-662-02796-7"},{"key":"1956_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis, 2nd edn. Cambridge University Press, Cambridge (2012). https:\/\/doi.org\/10.1017\/9781139020411","edition":"2"},{"issue":"2","key":"1956_CR26","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/0047-259X(75)90042-1","volume":"5","author":"AJ Izenman","year":"1975","unstructured":"Izenman, A.J.: Reduced-rank regression for the multivariate linear model. J. Multivar. Anal. 5(2), 248\u2013264 (1975). https:\/\/doi.org\/10.1016\/0047-259X(75)90042-1","journal-title":"J. Multivar. Anal."},{"key":"1956_CR27","doi-asserted-by":"crossref","unstructured":"Jacob, L., Obozinski, G., Vert, J.-P.: Group lasso with overlaps and graph lasso. In: Bottou, L., Littman, M. (eds) Proceedings of the 26th International Conference on Machine Learning, pp. 433\u2013440. Montreal. Omnipress (2009)","DOI":"10.1145\/1553374.1553431"},{"key":"1956_CR28","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. 3. Pearson Education, New York (1998)"},{"key":"1956_CR29","first-page":"617","volume-title":"Efficient k-Support Matrix Pursuit","author":"H Lai","year":"2014","unstructured":"Lai, H., Pan, Y., Canyi, L., Tang, Y., Yan, S.: Efficient k-Support Matrix Pursuit, pp. 617\u2013631. Springer, Berlin (2014)"},{"issue":"2","key":"1956_CR30","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/s11263-016-0904-7","volume":"120","author":"V Larsson","year":"2016","unstructured":"Larsson, V., Olsson, C.: Convex low rank approximation. Int. J. Comput. Vis. 120(2), 194\u2013214 (2016)","journal-title":"Int. J. Comput. Vis."},{"issue":"1","key":"1956_CR31","first-page":"173","volume":"2","author":"AS Lewis","year":"1995","unstructured":"Lewis, A.S.: The convex analysis of unitarily invariant matrix functions. J. Convex Anal. 2(1), 173\u2013183 (1995)","journal-title":"J. Convex Anal."},{"issue":"3","key":"1956_CR32","doi-asserted-by":"publisher","first-page":"A1686","DOI":"10.1137\/19M1259444","volume":"42","author":"Y Li","year":"2020","unstructured":"Li, Y., Liu, H., Wen, Z., Yuan, Y.: Low-rank matrix iteration using polynomial-filtered subspace extraction. SIAM J. Sci. Comput. 42(3), A1686\u2013A1713 (2020). https:\/\/doi.org\/10.1137\/19M1259444","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"1956_CR33","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"P-L Lions","year":"1979","unstructured":"Lions, P.-L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6), 964\u2013979 (1979). https:\/\/doi.org\/10.1137\/0716071","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"1956_CR34","doi-asserted-by":"publisher","first-page":"A1641","DOI":"10.1137\/120871328","volume":"35","author":"X Liu","year":"2013","unstructured":"Liu, X., Wen, Z., Zhang, Y.: Limited memory block Krylov subspace optimization for computing dominant singular value decompositions. SIAM J. Sci. Comput. 35(3), A1641\u2013A1668 (2013a). https:\/\/doi.org\/10.1137\/120871328","journal-title":"SIAM J. Sci. Comput."},{"issue":"8","key":"1956_CR35","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.sysconle.2013.04.005","volume":"62","author":"Z Liu","year":"2013","unstructured":"Liu, Z., Hansson, A., Vandenberghe, L.: Nuclear norm system identification with missing inputs and outputs. Syst. Control Lett. 62(8), 605\u2013612 (2013b). https:\/\/doi.org\/10.1016\/j.sysconle.2013.04.005","journal-title":"Syst. Control Lett."},{"issue":"3","key":"1956_CR36","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1080\/10556788.2014.936438","volume":"30","author":"Z Lu","year":"2015","unstructured":"Lu, Z., Yong, Z., Li, X.: Penalty decomposition methods for rank minimization. Optim. Methods Softw. 30(3), 531\u2013558 (2015). https:\/\/doi.org\/10.1080\/10556788.2014.936438","journal-title":"Optim. Methods Softw."},{"issue":"155","key":"1956_CR37","first-page":"1","volume":"17","author":"AM McDonald","year":"2016","unstructured":"McDonald, A.M., Pontil, M., Stamos, D.: New perspectives on k-support and cluster norms. J. Mach. Learn. Res. 17(155), 1\u201338 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"1956_CR38","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1561\/2400000003","journal-title":"Found. Trends Optim."},{"key":"1956_CR39","unstructured":"Peaucelle, D., Henrion, D., Labit, Y., Taitz, K.: User\u2019s guide for SEDUMI INTERFACE 1.04. 2002. LAAS-CNRS, Toulouse"},{"issue":"3","key":"1956_CR40","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010). https:\/\/doi.org\/10.1137\/070697835","journal-title":"SIAM Rev."},{"key":"1956_CR41","volume-title":"Convex Analysis","author":"RR Tyrrell","year":"1970","unstructured":"Tyrrell, R.R.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"1","key":"1956_CR42","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc."},{"key":"1956_CR43","doi-asserted-by":"crossref","unstructured":"Toh, K.C., Tutuncu, R.H., Todd, M.J.: On the implementation of SDPT3 (version 3.1)\u2014a MATLAB software package for semidefinite-quadratic-linear programming. In: IEEE International Conference on Robotics and Automation, pp. 290\u2013296 (2004)","DOI":"10.1109\/CACSD.2004.1393891"},{"key":"1956_CR44","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574","volume-title":"Numerical Linear Algebra","author":"LN Trefethen","year":"1997","unstructured":"Trefethen, L.N., David Bau, I.I.I.: Numerical Linear Algebra. SIAM, New York (1997)"},{"issue":"2","key":"1956_CR45","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10589-013-9628-6","volume":"58","author":"S Villa","year":"2014","unstructured":"Villa, S., Rosasco, L., Mosci, S., Verri, A.: Proximal methods for the latent group lasso penalty. Comput. Optim. Appl. 58(2), 381\u2013407 (2014). https:\/\/doi.org\/10.1007\/s10589-013-9628-6","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1956_CR46","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/110827144","volume":"24","author":"B Wu","year":"2014","unstructured":"Wu, B., Ding, C., Sun, D., Toh, K.-C.: On the Moreau\u2013Yosida regularization of the vector $$k$$-norm related functions. SIAM J. Optim. 24(2), 766\u2013794 (2014). https:\/\/doi.org\/10.1137\/110827144","journal-title":"SIAM J. Optim."},{"key":"1956_CR47","doi-asserted-by":"publisher","unstructured":"Zoltowski, D.M., Dhingra, N., Lin, F., Jovanovi\u0107, M.R.: Sparsity-promoting optimal control of spatially-invariant systems. In: 2014 American Control Conference, pp. 1255\u20131260 (2014). https:\/\/doi.org\/10.1109\/ACC.2014.6859491","DOI":"10.1109\/ACC.2014.6859491"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01956-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-021-01956-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01956-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T09:44:57Z","timestamp":1726220697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-021-01956-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,30]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1956"],"URL":"https:\/\/doi.org\/10.1007\/s10957-021-01956-2","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2021,11,30]]},"assertion":[{"value":"15 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}