{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T04:06:48Z","timestamp":1784606808914,"version":"3.55.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"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":["62131005"],"award-info":[{"award-number":["62131005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2020YFA0714001"],"award-info":[{"award-number":["2020YFA0714001"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Research Fund Program of Data Recovery Key Laboratory of Sichuan Province","award":["DRN2302"],"award-info":[{"award-number":["DRN2302"]}]},{"name":"Open Research Fund Program of Data Recovery Key Laboratory of Sichuan Province","award":["12171072"],"award-info":[{"award-number":["12171072"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10915-023-02404-1","type":"journal-article","created":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T09:03:47Z","timestamp":1701075827000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Provable Stochastic Algorithm for Large-Scale Fully-Connected Tensor Network Decomposition"],"prefix":"10.1007","volume":"98","author":[{"given":"Wen-Jie","family":"Zheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6540-946X","authenticated-orcid":false,"given":"Xi-Le","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu-Bang","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ting-Zhu","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"issue":"5","key":"2404_CR1","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1093\/nsr\/nwx069","volume":"5","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Meng, D., Yuan, M.: Sparse recovery: from vectors to tensors. Natl. Sci. Rev. 5(5), 756\u2013767 (2017)","journal-title":"Natl. Sci. Rev."},{"issue":"2","key":"2404_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0169-7439(97)00032-4","volume":"38","author":"R Bro","year":"1997","unstructured":"Bro, R.: PARAFAC. Tutorial and applications. Chemom. Intell. Lab. Syst. 38(2), 149\u2013171 (1997)","journal-title":"Chemom. Intell. Lab. Syst."},{"issue":"20","key":"2404_CR3","doi-asserted-by":"crossref","first-page":"5423","DOI":"10.1109\/TSP.2016.2586759","volume":"64","author":"T Yokota","year":"2016","unstructured":"Yokota, T., Zhao, Q., Cichocki, A.: Smooth PARAFAC decomposition for tensor completion. IEEE Trans. Signal Process. 64(20), 5423\u20135436 (2016)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"2404_CR4","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/s10915-022-02054-9","volume":"94","author":"C Zeng","year":"2023","unstructured":"Zeng, C.: Rank properties and computational methods for orthogonal tensor decompositions. J. Sci. Comput. 94(1), 6 (2023)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2404_CR5","doi-asserted-by":"crossref","first-page":"B55","DOI":"10.1137\/19M1294708","volume":"43","author":"J Pan","year":"2021","unstructured":"Pan, J., Ng, M.K., Liu, Y., Zhang, X., Yan, H.: Orthogonal nonnegative Tucker decomposition. SIAM J. Sci. Comput. 43(1), B55\u2013B81 (2021)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"2404_CR6","doi-asserted-by":"crossref","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"},{"issue":"6","key":"2404_CR7","doi-asserted-by":"crossref","first-page":"2928","DOI":"10.1109\/TSP.2012.2190410","volume":"60","author":"G Zhou","year":"2012","unstructured":"Zhou, G., Cichocki, A., Xie, S.: Fast nonnegative matrix\/tensor factorization based on low-rank approximation. IEEE Trans. Signal Process. 60(6), 2928\u20132940 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"2404_CR8","doi-asserted-by":"crossref","first-page":"32","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(2), 32 (2021)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2404_CR9","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1137\/110837711","volume":"34","author":"ME Kilmer","year":"2013","unstructured":"Kilmer, M.E., Braman, K., Hao, N., Hoover, R.C.: Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging. SIAM J. Matrix Anal. Appl. 34(1), 148\u2013172 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"6","key":"2404_CR10","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.1109\/TSP.2016.2639466","volume":"65","author":"Z Zhang","year":"2017","unstructured":"Zhang, Z., Aeron, S.: Exact tensor completion using t-SVD. IEEE Trans. Signal Process. 65(6), 1511\u20131526 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"2404_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10915-020-01404-9","volume":"87","author":"D Qiu","year":"2021","unstructured":"Qiu, D., Bai, M., Ng, M.K., Zhang, X.: Robust low transformed multi-rank tensor methods for image alignment. J. Sci. Comput. 87, 1\u201340 (2021)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"2404_CR12","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1137\/060661685","volume":"30","author":"L De Lathauwer","year":"2008","unstructured":"De Lathauwer, L.: Decompositions of a higher-order tensor in block terms-part i: lemmas for partitioned matrices. SIAM J. Matrix Anal. Appl. 30(3), 1022\u20131032 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"2404_CR13","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1109\/TSP.2016.2620965","volume":"65","author":"T Yokota","year":"2017","unstructured":"Yokota, T., Lee, N., Cichocki, A.: Robust multilinear tensor rank estimation using higher order singular value decomposition and information criteria. IEEE Trans. Signal Process. 65(5), 1196\u20131206 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"2404_CR14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s11075-016-0259-8","volume":"75","author":"E Onunwor","year":"2017","unstructured":"Onunwor, E., Reichel, L.: On the computation of a truncated SVD of a large linear discrete ill-posed problem. Numer. Algorithms 75(2), 359\u2013380 (2017)","journal-title":"Numer. Algorithms"},{"key":"2404_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10915-019-01102-1","volume":"82","author":"J-F Li","year":"2020","unstructured":"Li, J.-F., Li, W., Vong, S.-W., Luo, Q.-L., Xiao, M.: A Riemannian optimization approach for solving the generalized eigenvalue problem for nonsquare matrix pencils. J. Sci. Comput. 82, 1\u201343 (2020)","journal-title":"J. Sci. Comput."},{"key":"2404_CR16","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/s10915-017-0368-0","volume":"72","author":"Z Jia","year":"2017","unstructured":"Jia, Z., Wei, M.: A new TV-stokes model for image deblurring and denoising with fast algorithms. J. Sci. Comput. 72, 522\u2013541 (2017)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"2404_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10915-021-01679-6","volume":"89","author":"M Li","year":"2021","unstructured":"Li, M., Li, W., Chen, Y., Xiao, M.: The nonconvex tensor robust principal component analysis approximation model via the weighted $$\\ell $$ p-norm regularization. J. Sci. Comput. 89(3), 67 (2021)","journal-title":"J. Sci. Comput."},{"key":"2404_CR18","doi-asserted-by":"crossref","unstructured":"Maruhashi, K., Guo, F., Faloutsos, C.: Multiaspectforensics: pattern mining on large-scale heterogeneous networks with tensor analysis. In: 2011 International Conference on Advances in Social Networks Analysis and Mining, pp. 203\u2013210 (2011)","DOI":"10.1109\/ASONAM.2011.80"},{"issue":"3","key":"2404_CR19","first-page":"1","volume":"83","author":"M Che","year":"2020","unstructured":"Che, M., Wei, Y.: Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications. J. Sci. Comput. 83(3), 1\u201331 (2020)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"2404_CR20","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/s10915-020-01356-0","volume":"85","author":"X Zhao","year":"2020","unstructured":"Zhao, X., Bai, M., Ng, M.K.: Nonconvex optimization for robust tensor completion from grossly sparse observations. J. Sci. Comput. 85(2), 46 (2020)","journal-title":"J. Sci. Comput."},{"key":"2404_CR21","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/j.isprsjprs.2023.04.006","volume":"199","author":"W-J Zheng","year":"2023","unstructured":"Zheng, W.-J., Zhao, X.-L., Zheng, Y.-B., Lin, J., Zhuang, L., Huang, T.-Z.: Spatial\u2013spectral\u2013temporal connective tensor network decomposition for thick cloud removal. ISPRS J. Photogramm. Remote Sens. 199, 182\u2013194 (2023)","journal-title":"ISPRS J. Photogramm. Remote Sens."},{"issue":"5","key":"2404_CR22","doi-asserted-by":"crossref","first-page":"2466","DOI":"10.1109\/TIP.2017.2672439","volume":"26","author":"JA Bengua","year":"2017","unstructured":"Bengua, J.A., Phien, H.N., Tuan, H.D., Do, M.N.: Efficient tensor completion for color image and video recovery: low-rank tensor train. IEEE Trans. Image Process. 26(5), 2466\u20132479 (2017)","journal-title":"IEEE Trans. Image Process."},{"issue":"01","key":"2404_CR23","first-page":"9151","volume":"33","author":"L Yuan","year":"2019","unstructured":"Yuan, L., Li, C., Mandic, D., Cao, J., Zhao, Q.: Tensor ring decomposition with rank minimization on latent space: an efficient approach for tensor completion. Proc. AAAI Conf. Artif. Intell. 33(01), 9151\u20139158 (2019)","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"issue":"5","key":"2404_CR24","doi-asserted-by":"crossref","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":"2404_CR25","volume":"81","author":"S Garnerone","year":"2010","unstructured":"Garnerone, S., de Oliveira, T.R., Zanardi, P.: Typicality in random matrix product states. Rev. Mod. Phys. 81, 032336 (2010)","journal-title":"Rev. Mod. Phys."},{"key":"2404_CR26","unstructured":"Zhao, Q., Zhou, G., Xie, S., Zhang, L., Cichocki, A.: Tensor ring decomposition, arXiv preprint arXiv:1606.05535 (2016)"},{"key":"2404_CR27","doi-asserted-by":"crossref","DOI":"10.1103\/RevModPhys.93.045003","volume":"93","author":"JI Cirac","year":"2021","unstructured":"Cirac, J.I., P\u00e9rez-Garc\u00eda, D., Schuch, N., Verstraete, F.: Matrix product states and projected entangled pair states: concepts, symmetries, theorems. Rev. Mod. Phys. 93, 045003 (2021)","journal-title":"Rev. Mod. Phys."},{"issue":"10","key":"2404_CR28","doi-asserted-by":"crossref","DOI":"10.1088\/1367-2630\/12\/10\/103008","volume":"12","author":"KH Marti","year":"2010","unstructured":"Marti, K.H., Bauer, B., Reiher, M., Troyer, M., Verstraete, F.: Complete-graph tensor network states: a new fermionic wave function ansatz for molecules. New J. Phys. 12(10), 103008 (2010)","journal-title":"New J. Phys."},{"issue":"12","key":"2404_CR29","doi-asserted-by":"crossref","first-page":"11071","DOI":"10.1609\/aaai.v35i12.17321","volume":"35","author":"Y-B Zheng","year":"2021","unstructured":"Zheng, Y.-B., Huang, T.-Z., Zhao, X.-L., Zhao, Q., Jiang, T.-X.: Fully-connected tensor network decomposition and its application to higher-order tensor completion. Proc. AAAI 35(12), 11071\u201311078 (2021)","journal-title":"Proc. AAAI"},{"issue":"13","key":"2404_CR30","doi-asserted-by":"crossref","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."},{"issue":"3","key":"2404_CR31","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10915-013-9685-0","volume":"56","author":"DR Martin","year":"2013","unstructured":"Martin, D.R., Reichel, L.: Projected Tikhonov regularization of large-scale discrete ill-posed problems. J. Sci. Comput. 56(3), 471\u2013493 (2013)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"2404_CR32","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1007\/s10915-017-0597-2","volume":"75","author":"X Zhang","year":"2018","unstructured":"Zhang, X., Ng, M.K., Bai, M.: A fast algorithm for deconvolution and Poisson noise removal. J. Sci. Comput. 75(3), 1535\u20131554 (2018)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"2404_CR33","doi-asserted-by":"crossref","first-page":"1888","DOI":"10.1007\/s10915-019-01009-x","volume":"80","author":"C Shi","year":"2019","unstructured":"Shi, C., Huang, Z., Wan, L., Xiong, T.: Low-rank tensor completion based on log-det rank approximation and matrix factorization. J. Sci. Comput. 80(3), 1888\u20131912 (2019)","journal-title":"J. Sci. Comput."},{"key":"2404_CR34","doi-asserted-by":"crossref","first-page":"3868","DOI":"10.1109\/TIP.2022.3176133","volume":"31","author":"Z Jia","year":"2022","unstructured":"Jia, Z., Jin, Q., Ng, M.K., Zhao, X.-L.: Non-local robust quaternion matrix completion for large-scale color image and video inpainting. IEEE Trans. Image Process. 31, 3868\u20133883 (2022)","journal-title":"IEEE Trans. Image Process."},{"issue":"7\u20138","key":"2404_CR35","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/cem.1236","volume":"23","author":"P Comon","year":"2009","unstructured":"Comon, P., Luciani, X., de Almeida, A.L.F.: Tensor decompositions, alternating least squares and other tales. J. Chemom. 23(7\u20138), 393\u2013405 (2009)","journal-title":"J. Chemom."},{"issue":"3","key":"2404_CR36","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1137\/070690730","volume":"30","author":"L De Lathauwer","year":"2008","unstructured":"De Lathauwer, L., Nion, D.: Decompositions of a higher-order tensor in block terms-part iii: alternating least squares algorithms. SIAM J. Matrix Anal. Appl. 30(3), 1067\u20131083 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2404_CR37","volume":"390","author":"M Che","year":"2021","unstructured":"Che, M., Wei, Y., Yan, H.: Randomized algorithms for the low multilinear rank approximations of tensors. J. Comput. Appl. Math. 390, 113380 (2021)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"2404_CR38","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/19M1237016","volume":"41","author":"M Che","year":"2020","unstructured":"Che, M., Wei, Y., Yan, H.: The computation of 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."},{"issue":"2","key":"2404_CR39","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1137\/17M1112303","volume":"39","author":"C Battaglino","year":"2018","unstructured":"Battaglino, C., Ballard, G., Kolda, T.G.: A practical randomized CP tensor decomposition. SIAM J. Matrix Anal. Appl. 39(2), 876\u2013901 (2018)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"2404_CR40","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1137\/19M1266265","volume":"2","author":"TG Kolda","year":"2020","unstructured":"Kolda, T.G., Hong, D.: Stochastic gradients for large-scale tensor decomposition. SIAM J. Math. Data Sci. 2(4), 1066\u20131095 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"key":"2404_CR41","unstructured":"Cheng, D., Peng, R., Liu, Y., Perros, I.: SPALS: fast alternating least squares via implicit leverage scores sampling. Adv. Neural Inf. Process. Syst. 29 (2016)"},{"key":"2404_CR42","doi-asserted-by":"crossref","first-page":"2170","DOI":"10.1109\/TSP.2020.2982321","volume":"68","author":"X Fu","year":"2020","unstructured":"Fu, X., Ibrahim, S., Wai, H.-T., Gao, C., Huang, K.: Block-randomized stochastic proximal gradient for low-rank tensor factorization. IEEE Trans. Signal Process. 68, 2170\u20132185 (2020)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"2404_CR43","doi-asserted-by":"crossref","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 J. Math. Data Sci. 2(1), 189\u2013215 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"key":"2404_CR44","doi-asserted-by":"crossref","unstructured":"Dong, H., Tong, T., Ma, C., Chi, Y.: Fast and provable tensor robust principal component analysis via scaled gradient descent, arXiv preprint arXiv:2206.09109 (2022)","DOI":"10.1093\/imaiai\/iaad019"},{"issue":"5","key":"2404_CR45","doi-asserted-by":"crossref","DOI":"10.1002\/nla.2179","volume":"25","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Saibaba, A.K., Kilmer, M.E., Aeron, S.: A randomized tensor singular value decomposition based on the t-product. Numer. Linear Algebra Appl. 25(5), e2179 (2018)","journal-title":"Numer. Linear Algebra Appl."},{"key":"2404_CR46","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.image.2018.11.012","volume":"73","author":"L Yuan","year":"2019","unstructured":"Yuan, L., Zhao, Q., Gui, L., Cao, J.: High-order tensor completion via gradient-based optimization under tensor train format. Signal Process. Image Commun. 73, 53\u201361 (2019)","journal-title":"Signal Process. Image Commun."},{"key":"2404_CR47","unstructured":"Malik, O.A., Becker, S.: A sampling-based method for tensor ring decomposition. In: Proceedings of the 38th International Conference on Machine Learning, vol. 139, pp. 7400\u20137411 (2021)"},{"issue":"3","key":"2404_CR48","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1137\/17M1154382","volume":"19","author":"Y Khoo","year":"2021","unstructured":"Khoo, Y., Lu, J., Ying, L.: Efficient construction of tensor ring representations from sampling. Multiscale Model. Simul. 19(3), 1261\u20131284 (2021)","journal-title":"Multiscale Model. Simul."},{"issue":"3","key":"2404_CR49","doi-asserted-by":"crossref","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."},{"key":"2404_CR50","unstructured":"Cutkosky, A., Orabona, F.: Momentum-based variance reduction in non-convex sgd. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E., Garnett, R. (Eds.) Advances in Neural Information Processing Systems, vol.\u00a032 (2019)"},{"issue":"9","key":"2404_CR51","doi-asserted-by":"crossref","first-page":"2306","DOI":"10.1109\/TSP.2015.2404577","volume":"63","author":"X Fu","year":"2015","unstructured":"Fu, X., Ma, W.-K., Huang, K., Sidiropoulos, N.D.: Blind separation of quasi-stationary sources: exploiting convex geometry in covariance domain. IEEE Trans. Signal Process. 63(9), 2306\u20132320 (2015)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"2404_CR52","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1109\/TSP.2007.908929","volume":"56","author":"L De Lathauwer","year":"2008","unstructured":"De Lathauwer, L., Castaing, J.: Blind identification of underdetermined mixtures by simultaneous matrix diagonalization. IEEE Trans. Signal Process. 56(3), 1096\u20131105 (2008)","journal-title":"IEEE Trans. Signal Process."},{"key":"2404_CR53","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1016\/j.snb.2013.05.027","volume":"185","author":"A Vergara","year":"2013","unstructured":"Vergara, A., Fonollosa, J., Mahiques, J., Trincavelli, M., Rulkov, N., Huerta, R.: On the performance of gas sensor arrays in open sampling systems using inhibitory support vector machines. Sens. Actuators B Chem. 185, 462\u2013477 (2013)","journal-title":"Sens. Actuators B Chem."},{"issue":"2","key":"2404_CR54","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/JSTSP.2015.2503260","volume":"10","author":"N Vervliet","year":"2016","unstructured":"Vervliet, N., De Lathauwer, L.: A randomized block sampling approach to canonical polyadic decomposition of large-scale tensors. IEEE J. Sel. Top. Signal Process. 10(2), 284\u2013295 (2016)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"2404_CR55","doi-asserted-by":"crossref","unstructured":"Wang, Q., Cui, C., Han, D.: Accelerated doubly stochastic gradient descent for tensor CP decomposition. J. Optim. Theory Appl. 197(2), 665\u2013704 (2023)","DOI":"10.1007\/s10957-023-02193-5"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02404-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02404-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02404-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T14:12:14Z","timestamp":1704895934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02404-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,27]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["2404"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02404-1","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,27]]},"assertion":[{"value":"28 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"16"}}