{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T21:42:12Z","timestamp":1778535732853,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T00:00:00Z","timestamp":1673049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T00:00:00Z","timestamp":1673049600000},"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":["No. 12071149"],"award-info":[{"award-number":["No. 12071149"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"crossref","award":["No. 20511100200"],"award-info":[{"award-number":["No. 20511100200"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"crossref","award":["No. 22DZ2229014"],"award-info":[{"award-number":["No. 22DZ2229014"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003399","name":"Science and Technology Commission of Shanghai Municipality","doi-asserted-by":"crossref","award":["No. 21JC1402500"],"award-info":[{"award-number":["No. 21JC1402500"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s40314-022-02163-z","type":"journal-article","created":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T19:02:21Z","timestamp":1673118141000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems"],"prefix":"10.1007","volume":"42","author":[{"given":"Long-Ze","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8571-2271","authenticated-orcid":false,"given":"Xue-Ping","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,7]]},"reference":[{"issue":"1","key":"2163_CR1","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1137\/17M1137747","volume":"40","author":"ZZ Bai","year":"2018","unstructured":"Bai ZZ, Wu WT (2018) On greedy randomized Kaczmarz method for solving large sparse linear systems. SIAM J Sci Comput 40(1):592\u2013606","journal-title":"SIAM J Sci Comput"},{"key":"2163_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.aml.2018.03.008","volume":"83","author":"ZZ Bai","year":"2018","unstructured":"Bai ZZ, Wu WT (2018) On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems. Appl Math Lett 83:21\u201326","journal-title":"Appl Math Lett"},{"issue":"4","key":"2163_CR3","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1002\/nla.2237","volume":"26","author":"ZZ Bai","year":"2019","unstructured":"Bai ZZ, Wu WT (2019) On greedy randomized coordinate descent methods for solving large linear least-squares problems. Numer Linear Algebra Appl 26(4):2237","journal-title":"Numer Linear Algebra Appl"},{"key":"2163_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical Methods for Least Squares Problems","author":"A Bjorck","year":"1996","unstructured":"Bjorck A (1996) Numerical Methods for Least Squares Problems. SIAM, Philadelphia"},{"issue":"2","key":"2163_CR5","doi-asserted-by":"publisher","first-page":"627","DOI":"10.4208\/nmtma.OA-2018-0039","volume":"12","author":"K Du","year":"2019","unstructured":"Du K, Gao H (2019) A new theoretical estimate for the convergence rate of the maximal weighted residual Kaczmarz algorithm. Numer Math Theory Methods Appl 12(2):627\u2013639","journal-title":"Numer Math Theory Methods Appl"},{"issue":"3","key":"2163_CR6","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/moor.1100.0456","volume":"35","author":"S Leventhal","year":"2010","unstructured":"Leventhal S, Lewis AS (2010) Randomized methods for linear constraints: convergence rates and conditioning. Math Oper Res 35(3):641\u2013654","journal-title":"Math Oper Res"},{"issue":"1","key":"2163_CR7","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s10107-014-0800-2","volume":"152","author":"Z Lu","year":"2015","unstructured":"Lu Z, Xiao L (2015) On the complexity analysis of randomized block-coordinate descent methods. Math Program 152(1):615\u2013642","journal-title":"Math Program"},{"issue":"4","key":"2163_CR8","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1137\/15M1014425","volume":"36","author":"A Ma","year":"2015","unstructured":"Ma A, Needell D, Ramdas A (2015) Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods. SIAM J Matrix Anal Appl 36(4):1590\u20131604","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"1","key":"2163_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10957-016-1058-z","volume":"173","author":"I Necoara","year":"2017","unstructured":"Necoara I, Nesterov Y, Glineur F (2017) Random block coordinate descent methods for linearly constrained optimization over networks. J Optim Theory Appl 173(1):227\u2013254","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"2163_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov Y (2012) Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J Optim 22(2):341\u2013362","journal-title":"SIAM J Optim"},{"issue":"1","key":"2163_CR11","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/16M1060182","volume":"27","author":"Y Nesterov","year":"2017","unstructured":"Nesterov Y, Stich SU (2017) Efficiency of the accelerated coordinate descent method on structured optimization problems. SIAM J Optim 27(1):110\u2013123","journal-title":"SIAM J Optim"},{"issue":"1","key":"2163_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"CC Paige","year":"1982","unstructured":"Paige CC, Saunders MA (1982) LSQR: An algorithm for sparse linear equations and sparse least squares. ACM Trans Math Softw 8(1):43\u201371","journal-title":"ACM Trans Math Softw"},{"key":"2163_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/b98885","volume-title":"Numerical Mathematics","author":"A Quarteroni","year":"2007","unstructured":"Quarteroni A, Sacco R, Saleri F (2007) Numerical Mathematics. Springer, Berlin"},{"issue":"1","key":"2163_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik P, Tak\u00e1c M (2014) Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math Program 144(1):1\u201338","journal-title":"Math Program"},{"key":"2163_CR15","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/0024-3795(83)80037-8","volume":"53","author":"A Ruhe","year":"1983","unstructured":"Ruhe A (1983) Numerical aspects of Gram-Schmidt orthogonalization of vectors. Linear Algebra Appl 53:591\u2013601","journal-title":"Linear Algebra Appl"},{"issue":"2","key":"2163_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 (2009) A randomized Kaczmarz algorithm with exponential convergence. J Fourier Anal Appl 15(2):262\u2013278","journal-title":"J Fourier Anal Appl"},{"key":"2163_CR17","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.apnum.2020.06.014","volume":"157","author":"JH Zhang","year":"2020","unstructured":"Zhang JH, Guo JH (2020) On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems. Appl Numer Math 157:372\u2013384","journal-title":"Appl Numer Math"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-02163-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-022-02163-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-02163-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:03:03Z","timestamp":1725624183000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-022-02163-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,7]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["2163"],"URL":"https:\/\/doi.org\/10.1007\/s40314-022-02163-z","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,7]]},"assertion":[{"value":"3 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interests"}}],"article-number":"37"}}