{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T06:47:53Z","timestamp":1778827673548,"version":"3.51.4"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T00:00:00Z","timestamp":1522108800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T00:00:00Z","timestamp":1522108800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1447822"],"award-info":[{"award-number":["1447822"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1447822"],"award-info":[{"award-number":["1447822"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1618637"],"award-info":[{"award-number":["1618637"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1704458"],"award-info":[{"award-number":["1704458"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1704458"],"award-info":[{"award-number":["1704458"]}],"id":[{"id":"10.13039\/100000001","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":[[2018,6]]},"DOI":"10.1007\/s10589-018-0002-6","type":"journal-article","created":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T10:41:51Z","timestamp":1522147311000},"page":"395-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis"],"prefix":"10.1007","volume":"70","author":[{"given":"Hao","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0251-4227","authenticated-orcid":false,"given":"Daniel P.","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chong","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,27]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Andersson, F., Carlsson, M., Perfekt, K.M.: Operator-Lipschitz estimates for the singular value functional calculus. In: Proceedings of the American Mathematical Society (2015)","DOI":"10.1090\/proc\/12843"},{"issue":"1\u20132","key":"2_CR2","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.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1109\/TPAMI.2003.1177153","volume":"25","author":"R Basri","year":"2003","unstructured":"Basri, R., Jacobs, D.W.: Lambertian reflectance and linear subspaces. IEEE Trans. Pattern Anal. Mac. Intel. 25(2), 218\u2013233 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mac. Intel."},{"issue":"1","key":"2_CR4","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)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"2_CR5","first-page":"1","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends$${\\textregistered }$$. Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Mach. Learn."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s10957-014-0614-7","volume":"165","author":"K Bredies","year":"2015","unstructured":"Bredies, K., Lorenz, D.A., Reiterer, S.: Minimization of non-smooth, non-convex functionals by iterative thresholding. J. Optim. Theory Appl. 165(1), 78\u2013112 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"8","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/TPAMI.2012.230","volume":"35","author":"J Bruna","year":"2013","unstructured":"Bruna, J., Mallat, S.: Invariant scattering convolution networks. IEEE Trans. Pattern Anal. Mach. Intell. 35(8), 1872\u20131886 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58(3), 11 (2011)","journal-title":"J. ACM"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Wohlberg, B.: A nonconvex ADMM algorithm for group sparsity with sparse groups. In: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 6009\u20136013. IEEE (2013)","DOI":"10.1109\/ICASSP.2013.6638818"},{"issue":"1\u20132","key":"2_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-014-0826-5","volume":"155","author":"C Chen","year":"2016","unstructured":"Chen, C., He, B., Ye, Y., Yuan, X.: The direct extension of admm for multi-block convex minimization problems is not necessarily convergent. Math. Program. 155(1\u20132), 57\u201379 (2016)","journal-title":"Math. Program."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (2000)","DOI":"10.1137\/1.9780898719857"},{"key":"2_CR12","unstructured":"Eckstein, J., Yao, W.: Understanding the convergence of the alternating direction method of multipliers: Theoretical and computational perspectives. Technical Report Center for Operations Research, Rutgers University, 640 Bartholomew Road, Piscataway, New Jersey (2015)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Elhamifar, E., Vidal, R.: Clustering disjoint subspaces via sparse representation. In: IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), pp. 1926\u20131929. IEEE (2010)","DOI":"10.1109\/ICASSP.2010.5495317"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 2790\u20132797. IEEE (2009)","DOI":"10.1109\/CVPR.2009.5206547"},{"issue":"11","key":"2_CR15","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","volume":"35","author":"E Elhamifar","year":"2013","unstructured":"Elhamifar, E., Vidal, R.: Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 35(11), 2765\u20132781 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR16","series-title":"Chapter 3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0168-2024(08)70028-6","volume-title":"Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems","author":"M Fortin","year":"1983","unstructured":"Fortin, M., Glowinksi, R.: On decomposition-coordination methods using an augmented Lagrangian. In: Fortin, M., Glowinksi, R. (eds.) Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems. Chapter 3, pp. 97\u2013144. Elsevier, Amsterdam (1983)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0168-2024(08)70034-1","volume-title":"Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems","author":"D Gabay","year":"1983","unstructured":"Gabay, D.: Applications of the method of multipliers to variational inequalities. In: Fortin, M., Glowinksi, R. (eds.) Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems, pp. 299\u2013331. Elsevier, Amsterdam (1983). Chapter 9"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximations. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"2_CR19","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de dirichlet non lin\u00e9aires. ESAIM: Mathematical Modelling and Numerical Analysis - Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique 9(R2), 41\u201376 (1975). http:\/\/eudml.org\/doc\/193269"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Ho, J., Yang, M.H., Lim, J., Lee, K.C., Kriegman, D.: Clustering appearances of objects under varying illumination conditions. In: IEEE Conference on Computer Vision and Pattern Recognition, vol.\u00a01, pp. 11\u201318. IEEE (2003)","DOI":"10.1109\/CVPR.2003.1211332"},{"issue":"12","key":"2_CR21","doi-asserted-by":"publisher","first-page":"3655","DOI":"10.1109\/TIP.2006.882016","volume":"15","author":"W Hong","year":"2006","unstructured":"Hong, W., Wright, J., Huang, K., Ma, Y.: Multiscale hybrid linear models for lossy image representation. IEEE Trans. Image Process. 15(12), 3655\u20133671 (2006)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"2_CR22","doi-asserted-by":"publisher","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."},{"key":"2_CR23","unstructured":"Jiang, H.: Augmented Lagrangian based algorithms for nonconvex optimization with applications in subspace clustering. Ph.D. thesis, Johns Hopkins University (2016). https:\/\/jscholarship.library.jhu.edu\/handle\/1774.2\/838"},{"issue":"11","key":"2_CR24","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"issue":"5","key":"2_CR25","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1109\/TPAMI.2005.92","volume":"27","author":"KC Lee","year":"2005","unstructured":"Lee, K.C., Ho, J., Kriegman, D.J.: Acquiring linear subspaces for face recognition under variable lighting. IEEE Trans. Pattern Anal. Mach. Intell. 27(5), 684\u2013698 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s11228-004-7197-7","volume":"13","author":"AS Lewis","year":"2005","unstructured":"Lewis, A.S., Sendov, H.S.: Nonsmooth analysis of singular values. part I: Theory. Set-Valued Anal. 13(3), 213\u2013241 (2005)","journal-title":"Set-Valued Anal."},{"issue":"6","key":"2_CR27","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL 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."},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Liu, R., Lin, Z., De\u00a0la Torre, F., Su, Z.: Fixed-rank representation for unsupervised visual learning. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 598\u2013605. IEEE (2012)","DOI":"10.1109\/CVPR.2012.6247726"},{"key":"2_CR29","unstructured":"Liu, G., Lin, Z., Yu, Y.: Robust subspace segmentation by low-rank representation. In: International Conference on Machine Learning, pp. 663\u2013670 (2010)"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Liu, G., Yan, S.: Latent low-rank representation for subspace segmentation and feature extraction. In: 2011 IEEE International Conference on Computer Vision, pp. 1615\u20131622. IEEE (2011)","DOI":"10.1109\/ICCV.2011.6126422"},{"issue":"1","key":"2_CR31","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/TPAMI.2012.88","volume":"35","author":"G Liu","year":"2013","unstructured":"Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., Ma, Y.: Robust recovery of subspace structures by low-rank representation. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 171\u2013184 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Lu, C., Lin, Z., Yan, S.: Correlation adaptive subspace segmentation by trace lasso. In: IEEE International Conference on Computer Vision, pp. 1345\u20131352 (2013)","DOI":"10.1109\/ICCV.2013.170"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Lu, C.Y., Min, H., Zhao, Z.Q., Zhu, L., Huang, D.S., Yan, S.: Robust and efficient subspace segmentation via least squares regression. In: European Conference on Computer Vision, pp. 347\u2013360 (2012)","DOI":"10.1007\/978-3-642-33786-4_26"},{"key":"2_CR34","unstructured":"Open source computer vision library (OpenCV). http:\/\/sourceforge.net\/projects\/opencvlibrary"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Patel, V.M., Nguyen, H.V., Vidal, R.: Latent space sparse subspace clustering. In: International Conference on Computer Vision (2013)","DOI":"10.1109\/ICCV.2013.35"},{"issue":"4","key":"2_CR36","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1109\/JSTSP.2015.2402643","volume":"9","author":"VM Patel","year":"2015","unstructured":"Patel, V.M., Nguyen, H., Vidal, R.: Latent space sparse and low-rank subspace clustering. IEEE J. Sel. Top. Signal Process. 9(4), 691\u2013701 (2015)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Soltanolkotabi, M., Candes, E.J.: A geometric analysis of subspace clustering with outliers. The Annals of Statistics, pp. 2195\u20132238 (2012)","DOI":"10.1214\/12-AOS1034"},{"issue":"2","key":"2_CR38","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1214\/13-AOS1199","volume":"42","author":"M Soltanolkotabi","year":"2014","unstructured":"Soltanolkotabi, M., Elhamifar, E., Candes, E.: Robust subspace clustering. Ann. Stat. 42(2), 669\u2013699 (2014)","journal-title":"Ann. Stat."},{"issue":"615\u2013640","key":"2_CR39","first-page":"15","volume":"6","author":"KC Toh","year":"2010","unstructured":"Toh, K.C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pac. J. Optim. 6(615\u2013640), 15 (2010)","journal-title":"Pac. J. Optim."},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Tron, R., Vidal, R.: A benchmark for the comparsion of 3-D motion segmentation algorithms. In: IEEE Conference on Computer Vision and Pattern Recognition (2007)","DOI":"10.1109\/CVPR.2007.382974"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Vidal, R., Ma, Y., Sastry, S.: Generalized Principal Component Analysis. Springer Interdisciplinary Applied Mathematics (2016)","DOI":"10.1007\/978-0-387-87811-9"},{"issue":"2","key":"2_CR42","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MSP.2010.939739","volume":"28","author":"R Vidal","year":"2010","unstructured":"Vidal, R.: Subspace clustering. IEEE Signal Process. Mag. 28(2), 52\u201368 (2010)","journal-title":"IEEE Signal Process. Mag."},{"key":"2_CR43","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.patrec.2013.08.006","volume":"43","author":"R Vidal","year":"2014","unstructured":"Vidal, R., Favaro, P.: Low rank subspace clustering (LRSC). Pattern Recognit. Lett. 43, 47\u201361 (2014)","journal-title":"Pattern Recognit. Lett."},{"issue":"1","key":"2_CR44","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s11263-007-0099-z","volume":"79","author":"R Vidal","year":"2008","unstructured":"Vidal, R., Tron, R., Hartley, R.: Multiframe motion segmentation with missing data using PowerFactorization and GPCA. Int. J. Comput. Vis. 79(1), 85\u2013105 (2008)","journal-title":"Int. J. Comput. Vis."},{"issue":"4","key":"2_CR45","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"key":"2_CR46","unstructured":"Wang, F., Cao, W., Xu, Z.: Convergence of multi-block Bregman ADMM for nonconvex composite problems (2015). arXiv preprint arXiv:1505.03063"},{"key":"2_CR47","unstructured":"Wang, Y.X., Xu, H., Leng, C.: Provable subspace clustering: When LRR meets SSC. In: Neural Information Processing Systems (2013)"},{"key":"2_CR48","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of ADMM in nonconvex nonsmooth optimization (2015). arXiv preprint arXiv:1511.06324"},{"issue":"3","key":"2_CR49","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TPAMI.2015.2462360","volume":"38","author":"M Yin","year":"2016","unstructured":"Yin, M., Gao, J., Lin, Z.: Laplacian regularized low-rank representation and its applications. IEEE Trans. Pattern Anal. Mach. Intell. 38(3), 504\u2013517 (2016)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2_CR50","doi-asserted-by":"crossref","unstructured":"You, C., Li, C.G., Robinson, D., Vidal, R.: Oracle based active set algorithm for scalable elastic net subspace clustering. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 3928\u20133937 (2016)","DOI":"10.1109\/CVPR.2016.426"},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"You, C., Robinson, D., Vidal, R.: Scalable sparse subspace clustering by orthogonal matching pursuit. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 3918\u20133927 (2016)","DOI":"10.1109\/CVPR.2016.425"},{"key":"2_CR52","unstructured":"You, C., Vidal, R.: Geometric conditions for subspace-sparse recovery. In: Proceedings of the 32nd International Conference on Machine Learning (ICML-15), pp. 1585\u20131593 (2015)"},{"issue":"9","key":"2_CR53","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1162\/NECO_a_00762","volume":"27","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Lin, Z., Zhang, C., Gao, J.: Relations among some low-rank subspace recovery models. Neural Comput. 27(9), 1915\u20131950 (2015)","journal-title":"Neural Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0002-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0002-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0002-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T00:30:21Z","timestamp":1751502621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0002-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,27]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["2"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0002-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,27]]},"assertion":[{"value":"14 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}