{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T19:20:08Z","timestamp":1768072808067,"version":"3.49.0"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T00:00:00Z","timestamp":1656028800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T00:00:00Z","timestamp":1656028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901471"],"award-info":[{"award-number":["11901471"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771099"],"award-info":[{"award-number":["11771099"]}],"id":[{"id":"10.13039\/501100001809","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,9]]},"DOI":"10.1007\/s10957-022-02051-w","type":"journal-article","created":{"date-parts":[[2022,6,24]],"date-time":"2022-06-24T17:22:46Z","timestamp":1656091366000},"page":"852-877","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Perturbations of the Tcur Decomposition for Tensor Valued Data in the Tucker Format"],"prefix":"10.1007","volume":"194","author":[{"given":"Maolin","family":"Che","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juefei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yimin","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,24]]},"reference":[{"issue":"4","key":"2051_CR1","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/1186785.1186794","volume":"32","author":"BW Bader","year":"2006","unstructured":"Bader, B.W., Kolda, T.G.: Algorithm 862: Matlab tensor classes for fast algorithm prototyping. ACM Trans. Math. Softw. 32(4), 635\u2013653 (2006)","journal-title":"ACM Trans. Math. Softw."},{"issue":"5","key":"2051_CR2","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/0167-6377(82)90038-4","volume":"1","author":"JJ Bartholdi","year":"1982","unstructured":"Bartholdi, J.J.: A good submatrix is hard to find. Oper. Res. Lett. 1(5), 190\u2013193 (1982)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"2051_CR3","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/140977898","volume":"46","author":"C Boutsidis","year":"2017","unstructured":"Boutsidis, C., Woodruff, D.P.: Optimal CUR matrix decompositions. SIAM J. Comput. 46(2), 543\u2013589 (2017)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2051_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/17M1142880","volume":"39","author":"P Breiding","year":"2018","unstructured":"Breiding, P., Vannieuwenhoven, N.: The condition number of join decompositions. SIAM J. Matrix Anal. Appl. 39(1), 287\u2013309 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2051_CR5","doi-asserted-by":"publisher","first-page":"1908","DOI":"10.1093\/imanum\/drz026","volume":"40","author":"P Breiding","year":"2020","unstructured":"Breiding, P., Vannieuwenhoven, N.: On the average condition number of tensor rank decompositions. IMA J. Numer. Anal. 40(3), 1908\u20131936 (2020)","journal-title":"IMA J. Numer. Anal."},{"issue":"185","key":"2051_CR6","first-page":"1","volume":"22","author":"H Cai","year":"2021","unstructured":"Cai, H., Hamm, K., Huang, L., Needell, D.: Mode-wise tensor decompositions: multi-dimensional generalizations of CUR decompositions. J. Mach. Learn. Res. 22(185), 1\u201336 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"2051_CR7","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.laa.2010.03.020","volume":"433","author":"CF Caiafa","year":"2010","unstructured":"Caiafa, C.F., Cichocki, A.: Generalizing the column-row matrix decomposition to multi-way arrays. Linear Algebra Appl. 433, 557\u2013573 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"2051_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF02310791","volume":"35","author":"JD Carroll","year":"1970","unstructured":"Carroll, J.D., Chang, J.: Analysis of individual differences in multidimensional scaling via an $$n$$-way generalization of \u201cEckart\u2013Young\u2019\u2019 decomposition. Psychometrika 35(3), 283\u2013319 (1970)","journal-title":"Psychometrika"},{"issue":"5","key":"2051_CR9","doi-asserted-by":"publisher","first-page":"2737","DOI":"10.1137\/090766498","volume":"32","author":"S Chaturantabut","year":"2010","unstructured":"Chaturantabut, S., Sorensen, D.C.: Nonlinear model reduction via discrete empirical interpolation. SIAM J. Sci. Comput. 32(5), 2737\u20132764 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"2051_CR10","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10444-018-9622-8","volume":"45","author":"M Che","year":"2019","unstructured":"Che, M., Wei, Y.: Randomized algorithms for the approximations of Tucker and the tensor train decompositions. Adv. Comput. Math. 45(1), 395\u2013428 (2019)","journal-title":"Adv. Comput. Math."},{"key":"2051_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-2059-4","volume-title":"Theory and Computation of Complex Tensors and Its Applications","author":"M Che","year":"2020","unstructured":"Che, M., Wei, Y.: Theory and Computation of Complex Tensors and Its Applications. Springer, Singapore (2020)"},{"issue":"2","key":"2051_CR12","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/19M1237016","volume":"41","author":"M Che","year":"2020","unstructured":"Che, M., Wei, Y., Yan, H.: The computation for low multilinear rank approximations of tensors via power scheme and random projection. SIAM J. Matrix Anal. Appl. 41(2), 605\u2013636 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2051_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-021-01545-5","volume":"88","author":"M Che","year":"2021","unstructured":"Che, M., Wei, Y., Yan, H.: An efficient randomized algorithm for computing the approximate Tucker decomposition. J. Sci. Comput. 88, 1\u201329 (2021)","journal-title":"J. Sci. Comput."},{"issue":"4\u20135","key":"2051_CR14","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1561\/2200000059","volume":"9","author":"A Cichocki","year":"2016","unstructured":"Cichocki, A., Lee, N., Oseledets, I.V., Phan, A.H., Zhao, Q., Mandic, D.P.: Tensor networks for dimensionality reduction and large-scale optimization: part 1 low-rank tensor decompositions. Found. Trends Mach. Learn. 9(4\u20135), 249\u2013429 (2016)","journal-title":"Found. Trends Mach. Learn."},{"issue":"6","key":"2051_CR15","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1561\/2200000067","volume":"9","author":"A Cichocki","year":"2017","unstructured":"Cichocki, A., Lee, N., Oseledets, I.V., Phan, A.H., Zhao, Q., Mandic, D.P.: Tensor networks for dimensionality reduction and large-scale optimization: part 2 applications and future perspectives. Found. Trends Mach. Learn. 9(6), 431\u2013673 (2017)","journal-title":"Found. Trends Mach. Learn."},{"issue":"6","key":"2051_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/3019134","volume":"63","author":"KL Clarkson","year":"2017","unstructured":"Clarkson, K.L., Woodruff, D.P.: Low-rank approximation and regression in input sparsity time. J. ACM 63(6), 81\u201390 (2017)","journal-title":"J. ACM"},{"issue":"1","key":"2051_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1002\/cem.838","volume":"18","author":"L De Lathauwer","year":"2004","unstructured":"De Lathauwer, L.: First-order perturbation analysis of the best rank-$$({R}_1,{R}_2,{R}_3)$$ approximation in multilinear algebra. J. Chemom. 18(1), 2\u201311 (2004)","journal-title":"J. Chemom."},{"issue":"4","key":"2051_CR18","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0895479896305696","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21(4), 1253\u20131278 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2051_CR19","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/18M1163658","volume":"40","author":"P Drineas","year":"2019","unstructured":"Drineas, P., Ipsen, I.C.F.: Low-rank matrix approximations do not need a singular value gap. SIAM J. Matrix Anal. Appl. 40(1), 299\u2013319 (2019)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2051_CR20","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/S0097539704442702","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas, P., Kannan, R., Mahoney, M.W.: Fast Monte Carlo algorithms for matrices III: computing a compressed approximate matrix decomposition. SIAM J. Comput. 36(1), 184\u2013206 (2006)","journal-title":"SIAM J. Comput."},{"issue":"12","key":"2051_CR21","first-page":"2153","volume":"6","author":"P Drineas","year":"2005","unstructured":"Drineas, P., Mahoney, M.W.: On the Nystr\u00f6m method for approximating a Gram matrix for improved kernel-based learning. J. Mach. Learn. Res. 6(12), 2153\u20132175 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"2051_CR22","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.laa.2006.08.023","volume":"420","author":"P Drineas","year":"2007","unstructured":"Drineas, P., Mahoney, M.W.: A randomized algorithm for a tensor-based generalization of the singular value decomposition. Linear Algebra Appl. 420, 553\u2013571 (2007)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"2051_CR23","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/07070471X","volume":"30","author":"P Drineas","year":"2008","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Relative-error CUR matrix decompositions. SIAM J. Matrix Anal. Appl. 30(2), 844\u2013881 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2051_CR24","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00211-010-0331-6","volume":"117","author":"P Drineas","year":"2011","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S., Sarlos, T.: Faster least squares approximation. Numer. Math. 117(2), 219\u2013249 (2011)","journal-title":"Numer. Math."},{"issue":"4","key":"2051_CR25","doi-asserted-by":"publisher","first-page":"1422","DOI":"10.1137\/110823298","volume":"32","author":"L Eld\u00e9n","year":"2011","unstructured":"Eld\u00e9n, L., Savas, B.: Perturbation theory and optimality conditions for the best multilinear rank approximation of a tensor. SIAM J. Matrix Anal. Appl. 32(4), 1422\u20131450 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2051_CR26","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. Johns Hopkins University Press, Baltimore (2013)","edition":"4"},{"key":"2051_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0024-3795(96)00301-1","volume":"261","author":"SA Goreinov","year":"1997","unstructured":"Goreinov, S.A., Tyrtyshnikov, E.E., Zamarashkin, N.L.: A theory of pseudoskeleton approximations. Linear Algebra Appl. 261, 1\u201321 (1997)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2051_CR28","first-page":"53","volume":"36","author":"L Grasedyck","year":"2013","unstructured":"Grasedyck, L., Kressner, D., Tobler, C.: A literature survery of low-rank tensor approximation techniques. Ges. Angew. Math. Mech. 36(1), 53\u201378 (2013)","journal-title":"Ges. Angew. Math. Mech."},{"issue":"4","key":"2051_CR29","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1137\/090764189","volume":"31","author":"L Grasedyck","year":"2010","unstructured":"Grasedyck, L.: Hierarchical singular value decomposition of tensors. SIAM J. Matrix Anal. Appl. 31(4), 2029\u20132054 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"2051_CR30","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1016\/j.acha.2019.08.006","volume":"48","author":"K Hamm","year":"2020","unstructured":"Hamm, K., Huang, L.: Perspectives on CUR decompositions. Appl. Comput. Harmon. Anal. 48(3), 1088\u20131099 (2020)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"2051_CR31","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/19M128394X","volume":"42","author":"K Hamm","year":"2021","unstructured":"Hamm, K., Huang, L.: Perturbations of CUR decompositions. SIAM J. Matrix Anal. Appl. 42(1), 351\u2013375 (2021)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2051_CR32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027","volume-title":"Accuracy and Stability of Numerical Algorithms","author":"NJ Higham","year":"2002","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2002)","edition":"2"},{"key":"2051_CR33","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0024-3795(96)00397-7","volume":"261","author":"T Hwang","year":"1997","unstructured":"Hwang, T., Lin, W., Pierce, D.J.: Improved bound for rank revealing LU factorizations. Linear Algebra Appl. 261, 173\u2013186 (1997)","journal-title":"Linear Algebra Appl."},{"key":"2051_CR34","unstructured":"Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. In: Beals, R., Beck, A., Bellow, A., Hajian, A. (eds.) Conference in Modern Analysis and Probability (New Haven, CT, 1982), Contemporary Mathematics, vol.\u00a026, pp. 189\u2013206. American Mathematical Society, Providence, Rhode Islan, (1984)"},{"key":"2051_CR35","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"M Kilmer","year":"2011","unstructured":"Kilmer, M., Martin, C.: Factorization strategies for third-order tensors. Linear Algebra Appl. 435, 641\u2013658 (2011)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"2051_CR36","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"1","key":"2051_CR37","first-page":"981","volume":"13","author":"S Kumar","year":"2012","unstructured":"Kumar, S., Mohri, M., Talwalkar, A.: Sampling methods for the Nystr\u00f6m method. J. Mach. Learn. Res. 13(1), 981\u20131006 (2012)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"2051_CR38","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1073\/pnas.0803205106","volume":"106","author":"MW Mahoney","year":"2009","unstructured":"Mahoney, M.W., Drineas, P.: CUR matrix decompositions for improved data analysis. Proc. Natl. Acad. Sci. USA 106(3), 697\u2013702 (2009)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"3","key":"2051_CR39","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1137\/060665336","volume":"30","author":"MW Mahoney","year":"2008","unstructured":"Mahoney, M.W., Maggioni, M., Drineas, P.: Tensor-CUR decompositions for tensor-based data. SIAM J. Matrix Anal. Appl. 30(3), 957\u2013987 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2051_CR40","doi-asserted-by":"crossref","unstructured":"Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001, Vancouver, British Columbia, Canada, vol.\u00a02, pp. 416\u2013423 (2001)","DOI":"10.1109\/ICCV.2001.937655"},{"key":"2051_CR41","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.laa.2017.10.014","volume":"538","author":"A Mikhalev","year":"2018","unstructured":"Mikhalev, A., Oseledets, I.V.: Rectangular maximum-volume submatrices and their applications. Linear Algebra Appl. 538, 187\u2013211 (2018)","journal-title":"Linear Algebra Appl."},{"key":"2051_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0024-3795(02)00572-4","volume":"367","author":"L Miranian","year":"2013","unstructured":"Miranian, L., Gu, M.: Strong rank revealing LU factorizations. Linear Algebra Appl. 367, 1\u201316 (2013)","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"2051_CR43","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets, I.V.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"key":"2051_CR44","unstructured":"Osinsky, A.: Rectangular maximum volume and projective volume search algorithms. arXiv preprint arXiv:1809.02334 (2018)"},{"key":"2051_CR45","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.laa.2017.09.032","volume":"537","author":"A Osinsky","year":"2018","unstructured":"Osinsky, A., Zamarashkin, N.L.: Pseudo-skeleton approximations with better accuracy estimates. Linear Algebra Appl. 537, 221\u2013249 (2018)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"2051_CR46","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1137\/15M1048628","volume":"37","author":"AK Saibaba","year":"2016","unstructured":"Saibaba, A.K.: HOID: higher order interpolatory decomposition for tensors based on Tucker representation. SIAM J. Matrix Anal. Appl. 37(3), 1223\u20131249 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"13","key":"2051_CR47","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1109\/TSP.2017.2690524","volume":"65","author":"ND Sidiropoulos","year":"2017","unstructured":"Sidiropoulos, N.D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E.E., Faloutsos, C.: Tensor decomposition for signal processing and machine learning. IEEE Trans. Signal Process. 65(13), 3551\u20133582 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"2051_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2014.03.023","volume":"451","author":"Y Song","year":"2014","unstructured":"Song, Y., Qi, L.: Infinite and finite dimensional Hilbert tensors. Linear Algebra Appl. 451, 1\u201314 (2014)","journal-title":"Linear Algebra Appl."},{"key":"2051_CR49","doi-asserted-by":"crossref","unstructured":"Song, Z., Woodruff, D.P., Zhong, P.: Relative error tensor low rank approximation. In: SODA\u201919: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, California, San Diego, January 6- 9, pp. 2772\u20132789 (2019)","DOI":"10.1137\/1.9781611975482.172"},{"issue":"3","key":"2051_CR50","doi-asserted-by":"publisher","first-page":"A1454","DOI":"10.1137\/140978430","volume":"38","author":"DC Sorensen","year":"2016","unstructured":"Sorensen, D.C., Embree, M.: A DEIM induced CUR factorization. SIAM J. Sci. Comput. 38(3), A1454\u2013A1482 (2016)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"2051_CR51","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1137\/1019104","volume":"19","author":"GW Stewart","year":"1977","unstructured":"Stewart, G.W.: On the perturbation of pseudo-inverses, projections and linear least squares problems. SIAM Rev. 19(4), 634\u2013662 (1977)","journal-title":"SIAM Rev."},{"issue":"2","key":"2051_CR52","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s002110050451","volume":"83","author":"GW Stewart","year":"1999","unstructured":"Stewart, G.W.: Four algorithms for the the [sic] efficient computation of truncated pivoted QR approximations to a sparse matrix. Numer. Math. 83(2), 313\u2013323 (1999)","journal-title":"Numer. Math."},{"key":"2051_CR53","volume-title":"Matrix Perturbation Theory","author":"GW Stewart","year":"1990","unstructured":"Stewart, G.W., Sun, J.G.: Matrix Perturbation Theory. Academic Press, Boston (1990)"},{"issue":"4","key":"2051_CR54","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1137\/17M1159932","volume":"11","author":"DA Tarzanagh","year":"2018","unstructured":"Tarzanagh, D.A., Michailidis, G.: Fast randomized algorithms for t-product based tensor operations and decompositions with applications to imaging data. SIAM J. Imaging Sci. 11(4), 2629\u20132664 (2018)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1\u20132","key":"2051_CR55","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1142\/S1793536911000787","volume":"3","author":"JA Tropp","year":"2011","unstructured":"Tropp, J.A.: Improved analysis of the subsampled randomized Hadamard transform. Adv. Adapt. Data Anal. 3(1\u20132), 115\u2013126 (2011)","journal-title":"Adv. Adapt. Data Anal."},{"issue":"3","key":"2051_CR56","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker, L.R.: Some mathematical notes on three-mode factor analysis. Psychometrika 31(3), 279\u2013311 (1966)","journal-title":"Psychometrika"},{"key":"2051_CR57","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.laa.2017.08.014","volume":"535","author":"N Vannieuwenhoven","year":"2017","unstructured":"Vannieuwenhoven, N.: Condition numbers for the tensor rank decomposition. Linear Algebra Appl. 535, 35\u201386 (2017)","journal-title":"Linear Algebra Appl."},{"key":"2051_CR58","doi-asserted-by":"crossref","unstructured":"Wang, G., Wei, Y., Qiao, S.:,Generalized Inverses: Theory and Computations. 2nd\u00a0edn. Springer, Singapore; Science Press, Beijing (2018)","DOI":"10.1007\/978-981-13-0146-9"},{"issue":"1","key":"2051_CR59","first-page":"1697","volume":"17","author":"S Wang","year":"2016","unstructured":"Wang, S., Luo, L., Zhang, Z.: SPSD matrix approximation vis column selection: theories, algorithms, and extensions. J. Mach. Learn. Res. 17(1), 1697\u20131745 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2051_CR60","first-page":"2729","volume":"14","author":"S Wang","year":"2013","unstructured":"Wang, S., Zhang, Z.: Improving CUR matrix decomposition and the Nystr\u00f6m approximation via adaptive sampling. J. Mach. Learn. Res. 14(1), 2729\u20132769 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2051_CR61","first-page":"7329","volume":"17","author":"S Wang","year":"2016","unstructured":"Wang, S., Zhang, Z., Zhang, T.: Towards more efficient SPSD matrix approximation and CUR matrix decomposition. J. Mach. Learn. Res. 17(1), 7329\u20137377 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"1\u20132","key":"2051_CR62","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000060","volume":"10","author":"DP Woodruff","year":"2014","unstructured":"Woodruff, D.P.: Sketching as a tool for numerical linear algebra. Found. Trends Theor. Comput. Sci. 10(1\u20132), 1\u2013157 (2014)","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"1","key":"2051_CR63","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11856-021-2171-8","volume":"245","author":"J Xie","year":"2021","unstructured":"Xie, J., Xu, Z.: Subset selection for matrices with fixed blocks. Israel J. Math. 245(1), 1\u201326 (2021)","journal-title":"Israel J. Math."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02051-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02051-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02051-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T19:16:44Z","timestamp":1727464604000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02051-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,24]]},"references-count":63,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["2051"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02051-w","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,24]]},"assertion":[{"value":"14 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}