{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:58:25Z","timestamp":1765961905258,"version":"3.45.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T00:00:00Z","timestamp":1753228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T00:00:00Z","timestamp":1753228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s11075-025-02163-0","type":"journal-article","created":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T09:51:43Z","timestamp":1753264303000},"page":"1929-1964","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On linear convergence of Landweber-type methods"],"prefix":"10.1007","volume":"100","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1840-4455","authenticated-orcid":false,"given":"Andrzej","family":"Cegielski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,23]]},"reference":[{"key":"2163_CR1","unstructured":"Bauschke, H.: Projection Algorithms and Monotone Operators, Ph.D. Thesis, Department of Mathematics, Simon Fraser University, Burnaby, British Columbia, Canada (1996)"},{"key":"2163_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.: On projection algorithms for solving convex feasibility problems. SIAM Review. 38, 367\u2013426 (1996)","journal-title":"SIAM Review."},{"key":"2163_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmaa.2014.06.075","volume":"421","author":"HH Bauschke","year":"2015","unstructured":"Bauschke, H.H., Noll, D., Phan, H.M.: Linear and strong convergence of algorithms involving averaged nonexpansive operators. J. Math. Anal. Appl. 421, 1\u201320 (2015)","journal-title":"J. Math. Anal. Appl."},{"key":"2163_CR4","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1088\/0266-5611\/18\/2\/310","volume":"18","author":"C Byrne","year":"2002","unstructured":"Byrne, C.: Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Problems 18, 441\u2013453 (2002)","journal-title":"Inverse Problems"},{"key":"2163_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1088\/0266-5611\/20\/1\/006","volume":"20","author":"C Byrne","year":"2004","unstructured":"Byrne, C.: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Problems 20, 103\u2013120 (2004)","journal-title":"Inverse Problems"},{"key":"2163_CR6","first-page":"169","volume":"14","author":"A Cegielski","year":"2007","unstructured":"Cegielski, A.: Convergence of the projected surrogate constraints method for the linear split feasibility problems. J. Conv. Anal. 14, 169\u2013183 (2007)","journal-title":"J. Conv. Anal."},{"key":"2163_CR7","doi-asserted-by":"crossref","unstructured":"Cegielski, A.: Iterative Methods for Fixed Point Problems in Hilbert Spaces. Lecture Notes in Mathematics, vol. 2057. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-30901-4"},{"key":"2163_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1090\/conm\/658\/13139","volume":"658","author":"A Cegielski","year":"2016","unstructured":"Cegielski, A.: Landweber-type operator and its properties. Contemporary Mathematics 658, 139\u2013148 (2016)","journal-title":"Contemporary Mathematics"},{"key":"2163_CR9","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1007\/s11075-023-01623-9","volume":"95","author":"A Cegielski","year":"2024","unstructured":"Cegielski, A.: Strict pseudocontractions and demicontractions, their properties, and applications. Numer. Algorithms 95, 1611\u20131642 (2024)","journal-title":"Numer. Algorithms"},{"key":"2163_CR10","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1137\/17M1134986","volume":"28","author":"A Cegielski","year":"2018","unstructured":"Cegielski, A., Reich, S., Zalas, R.: Regular sequences of quasi-nonexpansive operators and their applications. SIAM J. Optim. 28, 1508\u20131532 (2018)","journal-title":"SIAM J. Optim."},{"key":"2163_CR11","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1080\/02331934.2019.1598407","volume":"69","author":"A Cegielski","year":"2020","unstructured":"Cegielski, A., Reich, S., Zalas, R.: Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators. Optimization 69, 605\u2013636 (2020)","journal-title":"Optimization"},{"key":"2163_CR12","first-page":"399","volume":"15","author":"A Cegielski","year":"2014","unstructured":"Cegielski, A., Zalas, R.: Properties of a class of approximately shrinking operators and their applications. Fixed Point Theory 15, 399\u2013426 (2014)","journal-title":"Fixed Point Theory"},{"key":"2163_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BF02142692","volume":"8","author":"Y Censor","year":"1994","unstructured":"Censor, Y., Elfving, T.: A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 8, 221\u2013239 (1994)","journal-title":"Numer. Algorithms"},{"key":"2163_CR14","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1137\/S089547980138705X","volume":"24","author":"Y Censor","year":"2002","unstructured":"Censor, Y., Elfving, T.: Block-iterative algorithms with diagonally scaled oblique projections for the linear feasibility problem. SIAM J. Matrix Anal. Appl. 24, 40\u201358 (2002)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2163_CR15","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/050639399","volume":"30","author":"Y Censor","year":"2008","unstructured":"Censor, Y., Elfving, T., Herman, G.T., Nikazad, T.: On diagonally relaxed orthogonal projection methods. SIAM J. Sci. Comput. 30, 473\u2013504 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"2163_CR16","doi-asserted-by":"publisher","first-page":"2071","DOI":"10.1088\/0266-5611\/21\/6\/017","volume":"21","author":"Y Censor","year":"2005","unstructured":"Censor, Y., Elfving, T., Kopf, N., Bortfeld, T.: The multiple-sets split feasibility problem and its applications for inverse problems. Inverse Probl. 21, 2071\u20132084 (2005)","journal-title":"Inverse Probl."},{"key":"2163_CR17","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1016\/S0167-8191(00)00100-9","volume":"27","author":"Y Censor","year":"2001","unstructured":"Censor, Y., Gordon, D., Gordon, R.: Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems. Parallel Computing 27, 777\u2013808 (2001)","journal-title":"Parallel Computing"},{"key":"2163_CR18","first-page":"115","volume-title":"Inherently Parallel Algorithms in Feasibility and Optimization and their Applications","author":"PL Combettes","year":"2001","unstructured":"Combettes, P.L.: Quasi-Fej\u00e9rian analysis of some optimization algorithms. In: Butnariu, D., Censor, Y., Reich, S. (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, pp. 115\u2013152. Elsevier, Amsterdam (2001)"},{"key":"2163_CR19","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0024-3795(85)90280-0","volume":"64","author":"AR De Pierro","year":"1985","unstructured":"De Pierro, A.R., Iusem, A.N.: A simultaneous projections method for linear inequalities. Lin. Alg. Appl. 64, 243\u2013253 (1985)","journal-title":"Lin. Alg. Appl."},{"key":"2163_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9180-5","volume-title":"Projectors and Projection Methods","author":"A Gal\u00e1ntai","year":"2004","unstructured":"Gal\u00e1ntai, A.: Projectors and Projection Methods. Kluwer Academic Publishers, Boston (2004)"},{"key":"2163_CR21","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1016\/j.cam.2011.09.039","volume":"236","author":"PC Hansen","year":"2012","unstructured":"Hansen, P.C., Saxild-Hansen, M.: AIR Tools \u2013 A MATLAB package of algebraic iterative reconstruction methods. J. Comput. Appl. Math. 236, 2167\u20132178 (2012)","journal-title":"J. Comput. Appl. Math."},{"key":"2163_CR22","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1109\/TIP.2003.815295","volume":"12","author":"M Jiang","year":"2003","unstructured":"Jiang, M., Wang, G.: Convergence of the simultaneous algebraic reconstruction technique (SART). IEEE Trans. Image Process 12, 957\u2013961 (2003)","journal-title":"IEEE Trans. Image Process"},{"key":"2163_CR23","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/TMI.2003.812253","volume":"22","author":"M Jiang","year":"2003","unstructured":"Jiang, M., Wang, G.: Convergence studies on iterative algorithms for image reconstruction. IEEE Trans. Med. Imaging. 22, 569\u2013579 (2003)","journal-title":"IEEE Trans. Med. Imaging."},{"key":"2163_CR24","first-page":"355","volume":"A35","author":"S Kaczmarz","year":"1937","unstructured":"Kaczmarz, S.: Angen\u00e4herte Aufl\u00f6sung von Systemen linearer Gleichungen. Bulletin International de l\u2019Acad\u00e9mie Polonaise des Sciences et des Lettres A35, 355\u2013357 (1937)","journal-title":"Bulletin International de l\u2019Acad\u00e9mie Polonaise des Sciences et des Lettres"},{"key":"2163_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0024-3795(93)00089-I","volume":"215","author":"KC Kiwiel","year":"1995","unstructured":"Kiwiel, K.C.: Block-iterative surrogate projection methods for convex feasibility problems. Linear Algebra and Applications 215, 225\u2013259 (1995)","journal-title":"Linear Algebra and Applications"},{"key":"2163_CR26","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/S1052623495279569","volume":"7","author":"KC Kiwiel","year":"1997","unstructured":"Kiwiel, K.C., \u0141opuch, B.: Surrogate projection methods for finding fixed points of firmly nonexpansive mappings. SIAM J. Opt. 7, 1084\u20131102 (1997)","journal-title":"SIAM J. Opt."},{"key":"2163_CR27","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, G., Mart\u00edn-M\u00e1rquez, V., Wang, F., Xu, H.-K.: Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Problems, 28, 085004 (18pp) (2012)","DOI":"10.1088\/0266-5611\/28\/8\/085004"},{"key":"2163_CR28","first-page":"482","volume":"2","author":"YuI Merzlyakov","year":"1962","unstructured":"Merzlyakov, Yu.I.: On a relaxation method of solving systems of linear inequalities (in Russian). Zh. Vych. Mat. i Mat. Fiz. 2, 482\u2013487 (1962)","journal-title":"Zh. Vych. Mat. i Mat. Fiz."},{"key":"2163_CR29","doi-asserted-by":"publisher","first-page":"4083","DOI":"10.1016\/j.na.2011.03.041","volume":"74","author":"A Moudafi","year":"2011","unstructured":"Moudafi, A.: A note on the split common fixed-point problem for quasi-nonexpansive operators. Nonlinear Anal. 74, 4083\u20134087 (2011)","journal-title":"Nonlinear Anal."},{"key":"2163_CR30","doi-asserted-by":"publisher","first-page":"4105","DOI":"10.1016\/j.na.2011.03.044","volume":"74","author":"F Wang","year":"2011","unstructured":"Wang, F., Xu, H.-K.: Cyclic algorithms for split feasibility problems in Hilbert spaces. Nonlinear Anal. 74, 4105\u20134111 (2011)","journal-title":"Nonlinear Anal."},{"key":"2163_CR31","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/20M1337910","volume":"31","author":"H-K Xu","year":"2021","unstructured":"Xu, H.-K., Cegielski, A.: The Landweber operator approach to the split equality problem. SIAM J. Opt. 31, 626\u2013652 (2021)","journal-title":"SIAM J. Opt."},{"key":"2163_CR32","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF00939954","volume":"72","author":"K Yang","year":"1992","unstructured":"Yang, K., Murty, K.G.: New iterative methods for linear inequalities. JOTA 72, 163\u2013185 (1992)","journal-title":"JOTA"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02163-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02163-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02163-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T04:59:53Z","timestamp":1763960393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02163-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,23]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2163"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02163-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2025,7,23]]},"assertion":[{"value":"25 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 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":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"The author is an Editorial Board Member of\n                      Numerical Algorithms\n                      . The author has no relevant financial or non-financial interests to disclose. There is no funding or not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}