{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:15:19Z","timestamp":1775081719793,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T00:00:00Z","timestamp":1741305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T00:00:00Z","timestamp":1741305600000},"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":"crossref","award":["12161030"],"award-info":[{"award-number":["12161030"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Hainan Provincial Natural Science Foundation of China","award":["523MS039"],"award-info":[{"award-number":["523MS039"]}]},{"name":"Hainan Provincial Natural Science Foundation of China","award":["623RC482"],"award-info":[{"award-number":["623RC482"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s11075-025-02036-6","type":"journal-article","created":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T00:00:31Z","timestamp":1741305631000},"page":"1157-1173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximal residual coordinate descent method with k-means clustering for solving large linear least-squares problems"],"prefix":"10.1007","volume":"101","author":[{"given":"Liu","family":"Rui","sequence":"first","affiliation":[]},{"given":"Yang","family":"Ai-Li","sequence":"additional","affiliation":[]},{"given":"Ma","family":"Jian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,7]]},"reference":[{"issue":"3","key":"2036_CR1","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/moor.1100.0456","volume":"35","author":"D Leventhal","year":"2010","unstructured":"Leventhal, D., Lewis, A.S.: Randomized methods for linear constraints: Convergence rates and conditioning. Math. Oper. Res. 35(3), 641\u2013654 (2010)","journal-title":"Math. Oper. Res."},{"key":"2036_CR2","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1002\/nla.2237","volume":"26","author":"Z-Z Bai","year":"2019","unstructured":"Bai, Z.-Z., Wu, W.-T.: On greedy randomized coordinate descent methods for solving large linear least-squares problems. Numer. Linear Algebra Appl. 26, 2237 (2019)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"11","key":"2036_CR3","doi-asserted-by":"publisher","first-page":"6869","DOI":"10.1109\/TIT.2017.2749330","volume":"63","author":"N Nguyen","year":"2017","unstructured":"Nguyen, N., Needell, D., Woolf, T.: Linear convergence of stochastic iterative greedy algorithms with sparse constraints. IEEE Trans. Inf. Theory 63(11), 6869\u20136895 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2036_CR4","unstructured":"Nutini, J.: Greed is good: Greedy optimization methods for large-scale structured problems. PhD thesis, University of British Columbia (2018)"},{"issue":"2","key":"2036_CR5","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s11075-023-01661-3","volume":"96","author":"A Mustafa","year":"2024","unstructured":"Mustafa, A., Saha, M.: A two-dimensional randomized extended Gauss-Seidel algorithm for solving least squares problems. Numer. Algorithms 96(2), 665\u2013686 (2024)","journal-title":"Numer. Algorithms"},{"key":"2036_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.laa.2020.10.028","volume":"611","author":"Z-Z Bai","year":"2021","unstructured":"Bai, Z.-Z., Wang, L., Wu, W.-T.: On convergence rate of the randomized GaussSeidel method. Linear Algebra Appl. 611, 237\u2013252 (2021)","journal-title":"Linear Algebra Appl."},{"key":"2036_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.rinam.2021.100180","volume":"12","author":"F Wang","year":"2021","unstructured":"Wang, F., Li, W.-G., Bao, W.-D., Lv, Z.-L.: Gauss-Seidel method with oblique direction. Results Appl. Math. 12, 100180 (2021)","journal-title":"Results Appl. Math."},{"issue":"4","key":"2036_CR8","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.4236\/jamp.2023.114068","volume":"11","author":"W-F Li","year":"2023","unstructured":"Li, W.-F., Zhang, P.-P.: Greedy randomized Gauss-Seidel method with oblique direction. J. Appl. Math. Phys. 11(4), 1036\u20131048 (2023)","journal-title":"J. Appl. Math. Phys."},{"issue":"2","key":"2036_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10092-021-00404-x","volume":"58","author":"Y Liu","year":"2021","unstructured":"Liu, Y., Jiang, X.-L., Gu, C.-Q.: On maximum residual block and two-step GaussSeidel algorithms for linear least-squares problems. Calcolo 58(2), 1\u201332 (2021)","journal-title":"Calcolo"},{"key":"2036_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2021.107057","volume":"116","author":"Y-Q Niu","year":"2021","unstructured":"Niu, Y.-Q., Zheng, B.: A new randomized Gauss-Seidel method for solving linear least-squares problems. Appl. Math. Lett. 116, 107057 (2021)","journal-title":"Appl. Math. Lett."},{"key":"2036_CR11","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, 262\u2013278 (2009)","journal-title":"J. Fourier Anal. Appl."},{"issue":"1","key":"2036_CR12","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":"2036_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2021.113828","volume":"403","author":"X-L Jiang","year":"2022","unstructured":"Jiang, X.-L., Zhang, K., Yin, J.-F.: Randomized block Kaczmarz methods with k-means clustering for solving large linear systems. J. Comput. Appl. Math. 403, 113828 (2022)","journal-title":"J. Comput. Appl. Math."},{"key":"2036_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.rinam.2022.100342","volume":"16","author":"W-G Li","year":"2022","unstructured":"Li, W.-G., Wang, Q., Bao, W.-D., Xing, L.-L.: Kaczmarz method with oblique projection. Results Appl. Math. 16, 100342 (2022)","journal-title":"Results Appl. Math."},{"issue":"4","key":"2036_CR15","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":"2036_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.aml.2018.12.022","volume":"91","author":"J-J 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":"2036_CR17","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s11075-022-01422-8","volume":"93","author":"S He","year":"2023","unstructured":"He, S., Dong, Q.-L., Li, X.: The randomized Kaczmarz algorithm with the probability distribution depending on the angle. Numer. Algorithms 93(1), 415\u2013440 (2023)","journal-title":"Numer. Algorithms"},{"key":"2036_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.apnum.2020.10.016","volume":"164","author":"X Yang","year":"2021","unstructured":"Yang, X.: A geometric probability randomized Kaczmarz method for large scale linear systems. Appl. Numer. Math. 164, 139\u2013160 (2021)","journal-title":"Appl. Numer. Math."},{"key":"2036_CR19","doi-asserted-by":"publisher","first-page":"2954","DOI":"10.4236\/jamp.2021.911189","volume":"9","author":"L Wen","year":"2021","unstructured":"Wen, L., Yin, F., Liao, Y.-M., Huang, G.-X.: A geometric Gaussian Kaczmarz method for large scaled consistent linear equations. J. Appl. Math. Phys. 9, 2954\u20132965 (2021)","journal-title":"J. Appl. Math. Phys."},{"issue":"1","key":"2036_CR20","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02036-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02036-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02036-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T08:09:07Z","timestamp":1770624547000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02036-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,7]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["2036"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02036-6","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,7]]},"assertion":[{"value":"20 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not Applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}