{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T01:32:45Z","timestamp":1772501565793,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T00:00:00Z","timestamp":1720137600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T00:00:00Z","timestamp":1720137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Open Fund of Tianjin Key Lab for Advanced Signal Processing","award":["2022ASP-TJ01"],"award-info":[{"award-number":["2022ASP-TJ01"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["1227127"],"award-info":[{"award-number":["1227127"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s11075-024-01872-2","type":"journal-article","created":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T01:01:33Z","timestamp":1720141293000},"page":"133-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Inertial randomized Kaczmarz algorithms for solving coherent linear systems"],"prefix":"10.1007","volume":"99","author":[{"given":"Songnian","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziting","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiao-Li","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,5]]},"reference":[{"issue":"3","key":"1872_CR1","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov\u2019s acclerated forward-backward method is actually faster than $$1\/k^2$$. SIAM J. Optim. 26(3), 1824\u20131834 (2016)","journal-title":"SIAM J. Optim."},{"key":"1872_CR2","doi-asserted-by":"publisher","first-page":"A592","DOI":"10.1137\/17M1137747","volume":"40","author":"ZZ 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, A592\u2013A606 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"1872_CR3","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. Springer (2010)","DOI":"10.1007\/978-1-4419-9467-7"},{"issue":"1","key":"1872_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"1872_CR5","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1109\/42.538946","volume":"15","author":"J Browne","year":"1996","unstructured":"Browne, J., DePierro, A.: A row-action alternative to the EM algorithm for maximizing likelihoods in emission tomography. IEEE Trans. Med. Imag. 15, 687\u2013699 (1996)","journal-title":"IEEE Trans. Med. Imag."},{"key":"1872_CR6","doi-asserted-by":"publisher","DOI":"10.1201\/b16485","volume-title":"Iterative Optimization in Inverse Problems","author":"CL Byrne","year":"2014","unstructured":"Byrne, C.L.: Iterative Optimization in Inverse Problems. CRC Press, Boca Raton (2014)"},{"key":"1872_CR7","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1137\/1023097","volume":"23","author":"Y Censor","year":"1981","unstructured":"Censor, Y.: Row-action methods for huge and sparse systems and their applications. SIAM Rev. 23, 444\u2013464 (1981)","journal-title":"SIAM Rev."},{"key":"1872_CR8","doi-asserted-by":"crossref","unstructured":"Dong, Q.L., Huang, J., Li, X.H., Cho, Y.J., Rassias, Th.M.: MiKM: Multi-step inertial Krasnosel\u2019ski\u01d0\u2013Mann algorithm and its applications. J. Global Optim. 73(4), 801\u2013824 (2019)","DOI":"10.1007\/s10898-018-0727-x"},{"issue":"3","key":"1872_CR9","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.1137\/21M1422963","volume":"43","author":"N Gazagnadou","year":"2022","unstructured":"Gazagnadou, N., Ibrahim, M., Gower, R.M.: RidgeSketch: a fast sketching based solver for large scale ridge regression. SIAM J. Matrix Anal. Appl. 43(3), 1440\u20131468 (2022)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1872_CR10","doi-asserted-by":"crossref","unstructured":"Ghadimi, E., Feyzmahdavian, H.R., Johansson, M.: Global convergence of the heavy-ball method for convex optimization. 2015 European Control Conference (ECC), pp. 310\u2013315. Linz, Austria (2015)","DOI":"10.1109\/ECC.2015.7330562"},{"key":"1872_CR11","unstructured":"Gower, R.M., Richtrik, P.: Stochastic dual ascent for solving linear systems. arXiv: 1512.06890 (2015), 28 pages"},{"key":"1872_CR12","unstructured":"Goebel, K., Reich, S.: Uniform convexity, hyperbolic geometry and non-expansive mappings. M. Dekker (1984)"},{"issue":"3","key":"1872_CR13","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1137\/120896219","volume":"7","author":"T Goldstein","year":"2014","unstructured":"Goldstein, T., O\u2019Donoghue, B., Setzer, S., Baraniuk, R.: Fast alternating direction optimization methods. SIAM J. Imaging Sc. 7(3), 1588\u20131623 (2014)","journal-title":"SIAM J. Imaging Sc."},{"key":"1872_CR14","first-page":"4239","volume":"217","author":"SN He","year":"2010","unstructured":"He, S.N., Yang, C.P., Duan, P.C.: Realization of the hybrid method for Mann iterations. Appl. Math. Comput. 217, 4239\u20134247 (2010)","journal-title":"Appl. Math. Comput."},{"key":"1872_CR15","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/42.241889","volume":"12","author":"GT Herman","year":"1993","unstructured":"Herman, G.T., Meyer, L.: Algebraic reconstruction technique can be made computationlly efficient. IEEE T. Med. Imaging 12, 600\u2013609 (1993)","journal-title":"IEEE T. Med. Imaging"},{"key":"1872_CR16","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/s10957-018-1226-4","volume":"176","author":"F Iutzeler","year":"2018","unstructured":"Iutzeler, F., Malick, J.: On the proximal gradient algorithm with alternated inertia. J. Optimiz. Theory App. 176, 688\u2013710 (2018)","journal-title":"J. Optimiz. Theory App."},{"key":"1872_CR17","first-page":"355","volume":"35","author":"S Kaczmarz","year":"1937","unstructured":"Kaczmarz, S.: Angen\u00e4herte Aufl\u00f6sung von Systemen linearer Gleichungen. Bull. Int. Acad. Polon. Sci. Lett. A 35, 355\u2013357 (1937)","journal-title":"Bull. Int. Acad. Polon. Sci. Lett. A"},{"key":"1872_CR18","unstructured":"Liang, J.W.: Convergence rates of first\u2013order operator splitting methods. Optimization and Control. Normandie Universit\u00e9; GREYC CNRS UMR 6072, (2016). English"},{"key":"1872_CR19","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s10589-020-00220-z","volume":"77","author":"N Loizou","year":"2020","unstructured":"Loizou, N., Richt\u00e1rik, P.: Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods. Comput. Optim. Appl. 77, 653\u2013710 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"1872_CR20","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.: Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods. SIAM J. Matrix Anal. Appl. 36, 1590\u20131604 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1872_CR21","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s10107-021-01649-8","volume":"194","author":"MdS Morshed","year":"2022","unstructured":"Morshed, Md.S., Islam, Md.S., Noor-E-Alam, Md.: Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration. Math. Program. 194, 719\u2013779 (2022)","journal-title":"Math. Program."},{"key":"1872_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.19139\/124","volume":"3","author":"Z Mu","year":"2015","unstructured":"Mu, Z., Peng, Y.: A note on the inertial proximal point method. Stat. Optim. Inf. Comput. 3, 241\u2013248 (2015)","journal-title":"Stat. Optim. Inf. Comput."},{"key":"1872_CR23","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, 199\u2013221 (2014)","journal-title":"Linear Algebra Appl."},{"key":"1872_CR24","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/s00041-012-9248-z","volume":"19","author":"D Needell","year":"2013","unstructured":"Needell, D., Ward, R.: Two-subspace projection method for coherent overdetermined systems. J. Fourier Anal. Appl. 19, 256\u2013269 (2013)","journal-title":"J. Fourier Anal. Appl."},{"key":"1872_CR25","unstructured":"Nesterov, Y.E.: A method for solving the convex programming problem with convergence rate $$O(1\/k^2)$$. Dokl. Akad. Nauk SSSR 269, 543\u2013547 (1983). (in Russian)"},{"key":"1872_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR. Comput. Math. Math. Phys. 4, 1\u201317 (1964)","journal-title":"USSR. Comput. Math. Math. Phys."},{"key":"1872_CR27","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.apnum.2020.06.009","volume":"157","author":"Y Shehu","year":"2020","unstructured":"Shehu, Y., Iyiola, O.S.: Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence. Appl. Numer. Math. 157, 315\u2013337 (2020)","journal-title":"Appl. Numer. Math."},{"issue":"1\u20132","key":"1872_CR28","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0377-0427(00)00361-7","volume":"122","author":"T Strohmer","year":"2000","unstructured":"Strohmer, T.: Numerical analysis of the non-uniform sampling problem. J. Comput. Appl. Math. 122(1\u20132), 297\u2013316 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"1872_CR29","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."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01872-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01872-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01872-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T07:40:15Z","timestamp":1744616415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01872-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,5]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1872"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01872-2","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,5]]},"assertion":[{"value":"26 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 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 that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"Not Applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval Section"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}