{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T02:07:29Z","timestamp":1785550049139,"version":"3.56.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T00:00:00Z","timestamp":1731715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T00:00:00Z","timestamp":1731715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Guizhou Provincial Basic Research Program","award":["QKHJC-ZK[2023]YB245"],"award-info":[{"award-number":["QKHJC-ZK[2023]YB245"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12061025"],"award-info":[{"award-number":["12061025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s11075-024-01982-x","type":"journal-article","created":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T03:01:21Z","timestamp":1731726081000},"page":"1123-1144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Randomized extended average block Kaczmarz method for inconsistent tensor equations under t-product"],"prefix":"10.1007","volume":"100","author":[{"given":"Liyuan","family":"An","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kun","family":"Liang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Han","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qilong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,16]]},"reference":[{"issue":"3","key":"1982_CR1","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"ME Kilmer","year":"2011","unstructured":"Kilmer, M.E., Martin, C.D.: Factorization strategies for third-order tensors. Linear Algebra Appl. 435(3), 641\u2013658 (2011)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"1982_CR2","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TPAMI.2019.2891760","volume":"42","author":"CY Lu","year":"2019","unstructured":"Lu, C.Y., Feng, J.S., Chen, Y.D., Liu, W., Lin, Z.C., Yan, S.C.: Tensor robust principal component analysis with a new tensor nuclear norm. IEEE T. Pattern Anal. 42(4), 925\u2013938 (2019)","journal-title":"IEEE T. Pattern Anal."},{"key":"1982_CR3","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.laa.2019.12.035","volume":"590","author":"Y Miao","year":"2020","unstructured":"Miao, Y., Qi, L.Q., Wei, Y.M.: Generalized tensor function via the tensor singular value decomposition based on the t-product. Linear Algebra Appl. 590, 258\u2013303 (2020)","journal-title":"Linear Algebra Appl."},{"issue":"6","key":"1982_CR4","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1080\/01630563.2022.2056198","volume":"43","author":"JF Chen","year":"2022","unstructured":"Chen, J.F., Wei, Y.M., Xu, Y.W.: Tensor CUR decomposition under t-product and its perturbation. Numer. Func. Anal. Opt. 43(6), 698\u2013722 (2022)","journal-title":"Numer. Func. Anal. Opt."},{"key":"1982_CR5","doi-asserted-by":"crossref","unstructured":"Lu, C.Y., Peng, X., Wei, Y.C.: Low-rank tensor completion with a new tensor nuclear norm induced by invertible linear transforms. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 5996\u20136004 (2019)","DOI":"10.1109\/CVPR.2019.00615"},{"issue":"3","key":"1982_CR6","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1109\/TIP.2017.2762595","volume":"27","author":"P Zhou","year":"2017","unstructured":"Zhou, P., Lu, C.Y., Lin, Z.C., Zhang, C.: Tensor factorization for low-rank tensor completion. IEEE T. Image Process. 27(3), 1152\u20131163 (2017)","journal-title":"IEEE T. Image Process."},{"issue":"3","key":"1982_CR7","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/s10589-022-00439-y","volume":"84","author":"Q Yu","year":"2023","unstructured":"Yu, Q., Zhang, X.Z.: T-product factorization based method for matrix and tensor completion problems. Comput. Optim. Appl. 84(3), 761\u2013788 (2023)","journal-title":"Comput. Optim. Appl."},{"key":"1982_CR8","doi-asserted-by":"crossref","unstructured":"Wang, Z.L., Dong, J.Y., Liu, X.G., Zeng, X.Y.: Low-rank tensor completion by approximating the tensor average rank. In: Proceedings of the IEEE\/CVF International Conference on Computer Vision, pp. 4612\u20134620 (2021)","DOI":"10.1109\/ICCV48922.2021.00457"},{"issue":"3","key":"1982_CR9","doi-asserted-by":"publisher","first-page":"2299","DOI":"10.1002\/nla.2299","volume":"27","author":"GJ Song","year":"2020","unstructured":"Song, G.J., Ng, M.K., Zhang, X.J.: Robust tensor completion using transformed tensor singular value decomposition. Numer. Linear Algebra Appl. 27(3), 2299 (2020)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"4","key":"1982_CR10","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."},{"key":"1982_CR11","doi-asserted-by":"crossref","unstructured":"Guide, M.EI., Ichi, A.EI., Jbilou, K., Sadaka, R.: On tensor Gmres and Golub-Kahan methods via the t-product for color image processing. Electron. J. Linear. Al. 37, 524\u2013543 (2021)","DOI":"10.13001\/ela.2021.5471"},{"key":"1982_CR12","doi-asserted-by":"crossref","unstructured":"Pena-Pena, K., Lau, D.L., Arce, G.R.: T-HGSP: Hypergraph signal processing using t-product tensor decompositions. IEEE Trans. Signal Inf. Process Netw. (2023)","DOI":"10.36227\/techrxiv.20982223.v1"},{"key":"1982_CR13","doi-asserted-by":"crossref","unstructured":"Long, Z., Liu, Y.P., Chen, L.X., Zhu, C.: Low rank tensor completion for multiway visual data. Signal Process. 155, 301\u2013316 (2019)","DOI":"10.1016\/j.sigpro.2018.09.039"},{"key":"1982_CR14","doi-asserted-by":"publisher","first-page":"114488","DOI":"10.1016\/j.cam.2022.114488","volume":"415","author":"L Reichel","year":"2022","unstructured":"Reichel, L., Ugwu, U.O.: Weighted tensor Golu-Kahan-Tikhonov-Type methods applied to image processing using a t-product. J. Comput. Appl. Math. 415, 114488 (2022)","journal-title":"J. Comput. Appl. Math."},{"key":"1982_CR15","unstructured":"Karczmarz, S.: Angenaherte auflosung von systemen linearer glei-chungen. Bull. Int. Acad. Pol. Sic. Let., Cl. Sci. Math. Nat. 355\u2013357 (1937)"},{"issue":"2","key":"1982_CR16","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s00041-008-9030-4","volume":"15","author":"T Strohmer","year":"2009","unstructured":"Strohmer, T., Vershynin, R.: A randomized Kaczmarz algorithm with exponential convergence. J. Fourier Anal. Appl. 15(2), 262\u2013278 (2009)","journal-title":"J. Fourier Anal. Appl."},{"issue":"1","key":"1982_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.laa.2012.12.022","volume":"441","author":"D Needell","year":"2014","unstructured":"Needell, D., Tropp, J.A.: Paved with good intentions: Analysis of a randomized block Kaczmarz method. Linear Algebra Appl. 441(1), 199\u2013221 (2014)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"1982_CR18","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1137\/19M1251643","volume":"40","author":"I Necoara","year":"2019","unstructured":"Necoara, I.: Faster randomized block Kaczmarz algorithms. SIAM J. Matrix Anal. Appl. 40(4), 1425\u20131452 (2019)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1982_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.aml.2018.12.022","volume":"91","author":"JJ Zhang","year":"2019","unstructured":"Zhang, J.J.: A new greedy Kaczmarz algorithm for the solution of very large linear systems. Appl. Math. Lett. 91, 207\u2013212 (2019)","journal-title":"Appl. Math. Lett."},{"issue":"1","key":"1982_CR20","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1137\/17M1137747","volume":"40","author":"Z-Z Bai","year":"2018","unstructured":"Bai, Z.-Z., Wu, W.-T.: On greedy randomized Kaczmarz method for solving large sparse linear systems. SIAM J. Sci. Comput. 40(1), 592\u2013606 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"1982_CR21","unstructured":"Nutini, J., Sepehry, B., Laradji, I., Schmidt, M., Koepke, H., Virani, A.: Convergence rates for greedy Kaczmarz algorithms, and faster randomized Kaczmarz rules using the orthogonality graph. In: Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, pp. 547\u2013556 (2016)"},{"key":"1982_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2020.106294","volume":"104","author":"YQ Niu","year":"2020","unstructured":"Niu, Y.Q., Zheng, B.: A greedy block Kaczmarz algorithm for solving large-scale linear systems. Appl. Math. Lett. 104, 106294 (2020)","journal-title":"Appl. Math. Lett."},{"key":"1982_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114372","volume":"413","author":"CQ Miao","year":"2022","unstructured":"Miao, C.Q., Wu, W.T.: On greedy randomized average block Kaczmarz method for solving large linear systems. J. Comput. Appl. Math. 413, 114372 (2022)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"1982_CR24","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10543-010-0265-5","volume":"50","author":"D Needell","year":"2010","unstructured":"Needell, D.: Randomized Kaczmarz solver for noisy linear systems. BIT Numer. Math. 50(2), 395\u2013403 (2010)","journal-title":"BIT Numer. Math."},{"issue":"2","key":"1982_CR25","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1137\/120889897","volume":"34","author":"A Zouzias","year":"2012","unstructured":"Zouzias, A., Freris, N.M.: Randomized extended Kaczmarz for solving least-squares. SIAM J. Matrix Anal. Appl. 34(2), 773\u2013793 (2012)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"6","key":"1982_CR26","doi-asserted-by":"publisher","first-page":"3541","DOI":"10.1137\/20M1312629","volume":"42","author":"K Du","year":"2020","unstructured":"Du, K., Si, W.T., Sun, X.H.: Randomized extended average block Kaczmarz for solving least squares. SIAM J. Sci. Comput. 42(6), 3541\u20133559 (2020)","journal-title":"SIAM J. Sci. Comput."},{"key":"1982_CR27","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.apnum.2023.10.002","volume":"195","author":"Y Liu","year":"2024","unstructured":"Liu, Y.: Accelerated greedy randomized augmented Kaczmarz algorithm for inconsistent linear systems. Appl. Numer. Math. 195, 142\u2013156 (2024)","journal-title":"Appl. Numer. Math."},{"key":"1982_CR28","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.apnum.2023.06.008","volume":"192","author":"Z-Z Bai","year":"2023","unstructured":"Bai, Z.-Z., Wang, L.: On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems. Appl. Numer. Math. 192, 197\u2013213 (2023)","journal-title":"Appl. Numer. Math."},{"issue":"3","key":"1982_CR29","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1007\/s11075-023-01540-x","volume":"94","author":"Y Zeng","year":"2023","unstructured":"Zeng, Y., Han, D., Su, Y., Xie, J.: Randomized Kaczmarz method with adaptive stepsizes for inconsistent linear systems. Numer. Algorithms 94(3), 1403\u20131420 (2023)","journal-title":"Numer. Algorithms"},{"key":"1982_CR30","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.laa.2022.07.003","volume":"652","author":"F Sch\u00f6pfer","year":"2022","unstructured":"Sch\u00f6pfer, F., Lorenz, D.A., Tondji, L., Winkler, M.: Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems. Linear Algebra Appl. 652, 132\u2013154 (2022)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"1982_CR31","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10543-021-00877-w","volume":"62","author":"A Ma","year":"2022","unstructured":"Ma, A., Molitor, D.: Randomized Kaczmarz for tensor linear systems. BIT Numer. Math. 62(1), 171\u2013194 (2022)","journal-title":"BIT Numer. Math."},{"issue":"4","key":"1982_CR32","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1137\/21M1398562","volume":"14","author":"XM Chen","year":"2021","unstructured":"Chen, X.M., Qin, J.: Regularized Kaczmarz algorithms for tensor recovery. SIAM J. Imaging Sci. 14(4), 1439\u20131471 (2021)","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"1982_CR33","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10589-022-00382-y","volume":"82","author":"XZ Wang","year":"2022","unstructured":"Wang, X.Z., Che, M.L., Wei, Y.M.: Randomized Kaczmarz methods for tensor complementarity problems. Comput. Optim. Appl. 82(3), 595\u2013615 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"1982_CR34","doi-asserted-by":"crossref","unstructured":"Wang, X.Z., Che, M.L., Mo, C.X., Wei, Y.M.: Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method. J. Comput. Appl. Math. 421 (2023)","DOI":"10.1016\/j.cam.2022.114856"},{"key":"1982_CR35","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.apnum.2024.04.016","volume":"202","author":"YM Liao","year":"2024","unstructured":"Liao, Y.M., Li, W., Yang, D.: The accelerated tensor Kaczmarz algorithm with adaptive parameters for solving tensor systems. Appl. Numer. Math. 202, 100\u2013119 (2024)","journal-title":"Appl. Numer. Math."},{"key":"1982_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, X.Q., Guo, X.F., Pan, J.Y.: A sampling greedy average regularized Kaczmarz method for tensor recovery. Numer. Linear Algebra, 2560 (2024)","DOI":"10.1002\/nla.2560"},{"issue":"23","key":"1982_CR37","first-page":"4594","volume":"10","author":"WD Bao","year":"2022","unstructured":"Bao, W.D., Zhang, F.Y., Li, W.G., Wang, Q., Gao, Y.: Randomized average Kaczmarz algorithm for tensor linear systems. MATHEMATICS-BASEL 10(23), 4594 (2022)","journal-title":"MATHEMATICS-BASEL"},{"key":"1982_CR38","doi-asserted-by":"crossref","unstructured":"Huang, G.X., Zhong, S.Y.: Tensor randomized extended Kaczmarz methods for large inconsistent tensor linear equations with t-product. Numer. Algorithms, 1\u201324 (2023)","DOI":"10.1007\/s11075-024-01982-x"},{"key":"1982_CR39","unstructured":"Du, K., Sun, X.H.: Randomized regularized extended Kaczmarz algorithms for tensor recovery. arXiv preprint arXiv:2112.08566 (2021)"},{"key":"1982_CR40","unstructured":"Lu, C.Y.: Tensor-tensor product toolbox. arXiv preprint arXiv:1806.07247 (2018)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01982-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01982-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01982-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:26:55Z","timestamp":1760164015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01982-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,16]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["1982"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01982-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,16]]},"assertion":[{"value":"27 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}