{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T12:07:37Z","timestamp":1748002057369,"version":"3.37.3"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T00:00:00Z","timestamp":1653523200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T00:00:00Z","timestamp":1653523200000},"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":["11771099","11901471"],"award-info":[{"award-number":["11771099","11901471"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10898-022-01182-8","type":"journal-article","created":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T02:02:16Z","timestamp":1653530536000},"page":"373-403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Randomized algorithms for the computation of multilinear rank-$$(\\mu _1,\\mu _2,\\mu _3)$$ approximations"],"prefix":"10.1007","volume":"87","author":[{"given":"Maolin","family":"Che","sequence":"first","affiliation":[]},{"given":"Yimin","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Yanwei","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,26]]},"reference":[{"key":"1182_CR1","doi-asserted-by":"publisher","first-page":"28684","DOI":"10.1109\/ACCESS.2021.3058103","volume":"9","author":"S Ahmadiasl","year":"2021","unstructured":"Ahmadiasl, S., Cichocki, A., Phan, A., Oseledets, I., Abukhovich, S., Tanaka, T.: Randomized algorithms for computation of Tucker decomposition and higher order SVD (HOSVD). IEEE Access 9, 28684\u201328706 (2021)","journal-title":"IEEE Access"},{"key":"1182_CR2","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/060673096","volume":"39","author":"N Ailon","year":"2009","unstructured":"Ailon, N., Chazelle, B.: The fast Johnson-Lindenstrauss transform and approximate nearest neighbors. SIAM Journal on Computing 39, 302\u2013322 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"1182_CR3","doi-asserted-by":"publisher","first-page":"2525","DOI":"10.1016\/j.camwa.2016.09.014","volume":"72","author":"Y Aizenbud","year":"2016","unstructured":"Aizenbud, Y., Shabat, G., Averbuch, A.: Randomized LU decomposition using sparse projections. Computers and Mathematics with Applications 72, 2525\u20132534 (2016)","journal-title":"Computers and Mathematics with Applications"},{"key":"1182_CR4","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 Transactions on Mathematical Software 32, 635\u2013653 (2006)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"1182_CR5","unstructured":"Bader, B.W., Kolda, T.G. et\u00a0al.: Matlab tensor toolbox version 3.0-dev. Available online (Oct. 2017). https:\/\/www.tensortoolbox.org"},{"key":"1182_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","volume":"312","author":"M Charikar","year":"2004","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. Theoretical Computer Science 312, 3\u201315 (2004)","journal-title":"Theoretical Computer Science"},{"key":"1182_CR7","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. Advances in Computational Mathematics 45, 395\u2013428 (2019)","journal-title":"Advances in Computational Mathematics"},{"key":"1182_CR8","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)"},{"key":"1182_CR9","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 Journal on Matrix Analysis and Applications 41, 605\u2013636 (2020)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1182_CR10","doi-asserted-by":"crossref","unstructured":"Che, M., Wei, Y., Yan, H.: An efficient randomized algorithm for computing the approximate Tucker decomposition. Journal of Scientific Computing, 88 (2021). article no. 32","DOI":"10.1007\/s10915-021-01545-5"},{"key":"1182_CR11","doi-asserted-by":"crossref","unstructured":"Che, M., Wei, Y., Yan, H.: Randomized algorithms for the low multilinear rank approximations of tensors. Journal of Computational and Applied Mathematics, 390 (2021). article no. 113380","DOI":"10.1016\/j.cam.2020.113380"},{"key":"1182_CR12","unstructured":"Cichocki, A.: Tensor networks for big data analytics and large-scale optimization problems, arXiv preprint arXiv:1407.3124, (2014)"},{"key":"1182_CR13","doi-asserted-by":"crossref","unstructured":"Cichocki, A., Zdunek, R., Phan, A.H., Amari, S.-I.: Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation. John Wiley & Sons (2009)","DOI":"10.1002\/9780470747278"},{"key":"1182_CR14","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Low rank approximation and regression in input sparsity time. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, (2013), pp.\u00a081\u201390","DOI":"10.1145\/2488608.2488620"},{"key":"1182_CR15","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 Journal on Matrix Analysis and Applications 21, 1253\u20131278 (2000)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1182_CR16","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1137\/S0895479898346995","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: On the best rank-1 and rank-$$(r_1, r_2,\\cdots, r_n)$$ approximation of higher-order tensors. SIAM Journal on Matrix Analysis and Applications 21, 1324\u20131342 (2000)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1182_CR17","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 and its Applications 420, 553\u2013571 (2007)","journal-title":"Linear Algebra and its Applications"},{"key":"1182_CR18","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2842602","volume":"59","author":"P Drineas","year":"2016","unstructured":"Drineas, P., Mahoney, M.W.: RandNLA: randomized numerical linear algebra. Comm. ACM 59, 80\u201390 (2016)","journal-title":"Comm. ACM"},{"key":"1182_CR19","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1137\/070688316","volume":"31","author":"L Eld\u00e9n","year":"2009","unstructured":"Eld\u00e9n, L., Savas, B.: A Newton-Grassmann method for computing the best multilinear rank-$$(r_1, r_2, r_3)$$ approximation of a tensor. SIAM Journal on Matrix Analysis and Applications 31, 248\u2013271 (2009)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1182_CR20","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/34.927464","volume":"23","author":"AS Georghiades","year":"2001","unstructured":"Georghiades, A.S., Belhumeur, P.N., Kriegman, D.: From few to many: illumination cone models for face recognition under variable lighting and pose. IEEE Transactions on Pattern Analysis and Machine Intelligence 23, 643\u2013660 (2001)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"1182_CR21","doi-asserted-by":"crossref","unstructured":"Goreinov, S.A., Oseledets, I.V., Savostyanov, D.V.: Wedderburn rank reduction and Krylov subspace method for tensor approximation. Part 1: Tucker case. SIAM Journal on Scientific Computing, 34 (2012), pp.\u00a0A1\u2013A27","DOI":"10.1137\/100792056"},{"key":"1182_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/gamm.201310004","volume":"36","author":"L Grasedyck","year":"2013","unstructured":"Grasedyck, L., Kressner, D., Tobler, C.: A literature survey of low-rank tensor approximation techniques. GAMM-Mitteilungen 36, 53\u201378 (2013)","journal-title":"GAMM-Mitteilungen"},{"key":"1182_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P.G., Tropp, J.A.: Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review 53, 217\u2013288 (2011)","journal-title":"SIAM Review"},{"key":"1182_CR24","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1137\/090764827","volume":"32","author":"M Ishteva","year":"2011","unstructured":"Ishteva, M., Absil, P.-A., Van Huffel, S., De Lathauwer, L.: Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme. SIAM Journal on Matrix Analysis and Applications 32, 115\u2013135 (2011)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1182_CR25","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 Review 51, 455\u2013500 (2009)","journal-title":"SIAM Review"},{"key":"1182_CR26","doi-asserted-by":"publisher","first-page":"A1879","DOI":"10.1137\/16M1093896","volume":"39","author":"D Kressner","year":"2017","unstructured":"Kressner, D., Perisa, L.: Recompression of Hadamard products of tensors in Tucker format. SIAM Journal on Scientific Computing 39, A1879\u2013A1902 (2017)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"1182_CR27","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.ast.2009.12.003","volume":"14","author":"LS Lorente","year":"2010","unstructured":"Lorente, L.S., Vega, J.M., Velazquez, A.: Compression of aerodynamic databases using high-order singular value decomposition. Aerospace Science and Technology 14, 168\u2013177 (2010)","journal-title":"Aerospace Science and Technology"},{"key":"1182_CR28","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.2514\/1.35258","volume":"45","author":"LS Lorente","year":"2010","unstructured":"Lorente, L.S., Vega, J.M., Velazquez, A.: Generation of aerodynamic databases using high-order singular value decomposition. Journal of Aircraft 45, 1779\u20131788 (2010)","journal-title":"Journal of Aircraft"},{"key":"1182_CR29","first-page":"123","volume":"3","author":"MW Mahoney","year":"2011","unstructured":"Mahoney, M.W.: Randomized algorithms for matrices and data, Foundations and Trends in Machine. Learning 3, 123\u2013224 (2011)","journal-title":"Learning"},{"key":"1182_CR30","doi-asserted-by":"publisher","unstructured":"Malik, O.A., Becker, S.: Fast randomized matrix and tensor interpolative decomposition using CountSketch. Adv. Comput. Math. 46, 76 (2020). https:\/\/doi.org\/10.1007\/s10444-020-09816-9","DOI":"10.1007\/s10444-020-09816-9"},{"key":"1182_CR31","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1002\/rsa.20218","volume":"33","author":"J Matousek","year":"2008","unstructured":"Matousek, J.: On variants of the Johnson-Lindenstrauss lemma. Random Structures and Algorithms 33, 142\u2013156 (2008)","journal-title":"Random Structures and Algorithms"},{"key":"1182_CR32","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1137\/19M1261043","volume":"2","author":"R Minster","year":"2020","unstructured":"Minster, R., Saibaba, A.K., Kilmer, M.E.: Randomized algorithms for low-rank tensor decompositions in the Tucker format. SIAM Journal on Mathematics of Data Science 2, 189\u2013215 (2020)","journal-title":"SIAM Journal on Mathematics of Data Science"},{"key":"1182_CR33","unstructured":"Navasca, C., De\u00a0Lathauwer, L.: Low multilinear rank tensor approximation via semidefinite programming In: IEEE 17th European Signal Processing Conference, pp.\u00a0520\u2013524 (2009)"},{"key":"1182_CR34","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1016\/j.jsc.2005.05.007","volume":"40","author":"L Qi","year":"2005","unstructured":"Qi, L.: Eigenvalues of a real supersymmetric tensor. Journal of Symbolic Computation 40, 1302\u20131324 (2005)","journal-title":"Journal of Symbolic Computation"},{"key":"1182_CR35","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 Journal on Matrix Analysis and Applications 37, 1223\u20131249 (2016)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1182_CR36","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1016\/j.patcog.2006.08.004","volume":"40","author":"B Savas","year":"2007","unstructured":"Savas, B., Eld\u00e9n, L.: Handwritten digit classification using higher order singular value decomposition. Pattern Recognition 40, 993\u20131003 (2007)","journal-title":"Pattern Recognition"},{"key":"1182_CR37","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1016\/j.laa.2011.12.007","volume":"438","author":"B Savas","year":"2013","unstructured":"Savas, B., Eld\u00e9n, L.: Krylov-type methods for tensor computations I. Linear Algebra and its Applications 438, 891\u2013918 (2013)","journal-title":"Linear Algebra and its Applications"},{"key":"1182_CR38","doi-asserted-by":"publisher","first-page":"3352","DOI":"10.1137\/090763172","volume":"32","author":"B Savas","year":"2010","unstructured":"Savas, B., Lim, L.-H.: Quasi-Newton methods on Grassmannians and multilinear approximations of tensors. SIAM Journal on Scientific Computing 32, 3352\u20133393 (2010)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"1182_CR39","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, pp. 2772\u20132789 (2019)","DOI":"10.1137\/1.9781611975482.172"},{"key":"1182_CR40","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1137\/19M1257718","volume":"2","author":"Y Sun","year":"2019","unstructured":"Sun, Y., Guo, Y., Luo, C., Tropp, J.A., Udell, M.: Low-rank Tucker approximation of a tensor from streaming data. SIAM Journal on Mathematics of Data Science 2, 1123\u20131150 (2019)","journal-title":"SIAM Journal on Mathematics of Data Science"},{"key":"1182_CR41","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TSMC.2015.2482458","volume":"46","author":"P Symeonidis","year":"2016","unstructured":"Symeonidis, P.: ClustHOSVD: Item recommendation by combining semantically enhanced tag clustering with tensor HOSVD. IEEE Transactions on Systems, Man, and Cybernetics: Systems 46, 1240\u20131251 (2016)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"1182_CR42","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1137\/17M1111590","volume":"38","author":"JA Tropp","year":"2017","unstructured":"Tropp, J.A., Yurtsever, A., Udell, M., Cevher, V.: Practical sketching algorithms for low-rank matrix approximation. SIAM Journal on Matrix Analysis and Applications 38, 1454\u20131485 (2017)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1182_CR43","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, 279\u2013311 (1966)","journal-title":"Psychometrika"},{"key":"1182_CR44","doi-asserted-by":"publisher","first-page":"A1027","DOI":"10.1137\/110836067","volume":"34","author":"N Vannieuwenhoven","year":"2012","unstructured":"Vannieuwenhoven, N., Vandebril, R., Meerbergen, K.: A new truncation strategy for the higher-order singular value decomposition. SIAM Journal on Scientific Computing 34, A1027\u2013A1052 (2012)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"1182_CR45","doi-asserted-by":"crossref","unstructured":"Vasilescu, M., Terzopoulos, D.: Multilinear image analysis for facial recognition. In: Proceedings. 16th International Conference on Pattern Recognition, vol.\u00a02, IEEE, pp.\u00a0511\u2013514 (2002)","DOI":"10.1109\/ICPR.2002.1048350"},{"key":"1182_CR46","doi-asserted-by":"crossref","unstructured":"Vasilescu, M., Terzopoulos, D.: Multilinear subspace analysis of image ensembles. In: IEEE Computer Soc. Conf. Computer Vision and Pattern Recognition, vol.\u00a02, IEEE, pp.\u00a093\u201399 (2003)","DOI":"10.1109\/CVPR.2003.1211457"},{"key":"1182_CR47","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1145\/1015706.1015725","volume":"23","author":"M Vasilescu","year":"2004","unstructured":"Vasilescu, M., Terzopoulos, D.: Tensor Textures: Multilinear image-based rendering. ACM Transactions on Graphics 23, 336\u2013342 (2004)","journal-title":"ACM Transactions on Graphics"},{"key":"1182_CR48","unstructured":"Vervliet, N., Debals, O., Sorber, L., Van\u00a0Barel, M., De\u00a0Lathauwer, L.: Tensorlab 3.0. Available online, March 2016. http:\/\/tensorlab.net"},{"key":"1182_CR49","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. Foundations and Trends in Theoretical Computer Science 10, 1\u2013157 (2014)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"1182_CR50","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.acha.2007.12.002","volume":"25","author":"F Woolfe","year":"2008","unstructured":"Woolfe, F., Liberty, E., Rokhlin, V., Tygert, M.: A fast randomized algorithm for the approximation of matrices. Applied and Computational Harmonic Analysis 25, 335\u2013366 (2008)","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"1182_CR51","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1137\/17M1141977","volume":"39","author":"W Yu","year":"2018","unstructured":"Yu, W., Gu, Y., Li, Y.: Efficient randomized algorithms for the fixed-precision low-rank matrix approximation. SIAM Journal on Matrix Analysis and Applications 39, 1339\u20131359 (2018)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"1182_CR52","unstructured":"Zhou, G., Cichocki, A., Xie, S.: Decomposition of big tensors with low multilinear rank, arXiv preprint arXiv:1412.1885v1, (2014)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01182-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01182-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01182-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T22:28:35Z","timestamp":1727303315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01182-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,26]]},"references-count":52,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1182"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01182-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2022,5,26]]},"assertion":[{"value":"18 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}