The Kaczmarz method is an iterative numerical method for solving large and sparse rectangular systems of linear equations. Gearhart, Koshy and Tam have developed an acceleration technique for the Kaczmarz method that minimizes the distance to the desired solution in the direction of a full Kaczmarz step.<\/p>\n
The present paper generalizes this technique to an acceleration scheme that minimizes the Euclidean norm error over an affine subspace spanned by a number of previous iterates and one additional cycle of the Kaczmarz method. The key challenge is to find a formulation in which all parameters of the least-squares problem defining the unique minimizer are known, and to solve this problem efficiently.<\/p>\n
When only a single Kaczmarz cycle is considered, the proposed affine search is more effective than the Gearhart-Koshy\/Tam line-search, which in turn is more effective than the underlying Kaczmarz method. A numerical experiment from the context of computerized tomography suggests that the proposed affine search has the potential to outperform the the Gearhart-Koshy\/Tam line-search and the underlying Kaczmarz method in terms of the computational cost that is needed to achieve a given error tolerance.<\/p>","DOI":"10.1090\/mcom\/3818","type":"journal-article","created":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T16:12:59Z","timestamp":1673453579000},"page":"1251-1272","source":"Crossref","is-referenced-by-count":2,"title":["Generalized Gearhart-Koshy acceleration for the Kaczmarz method"],"prefix":"10.1090","volume":"92","author":[{"given":"Janosch","family":"Rieger","sequence":"first","affiliation":[]}],"member":"14","published-online":{"date-parts":[[2023,2,2]]},"reference":[{"issue":"1","key":"1","doi-asserted-by":"publisher","first-page":"A592--A606","DOI":"10.1137\/17M1137747","article-title":"On greedy randomized Kaczmarz method for solving large sparse linear systems","volume":"40","author":"Bai, Zhong-Zhi","year":"2018","journal-title":"SIAM J. Sci. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/1064-8275","issn-type":"print"},{"issue":"9","key":"2","doi-asserted-by":"publisher","first-page":"3433","DOI":"10.1090\/S0002-9947-03-03136-2","article-title":"Accelerating the convergence of the method of alternating projections","volume":"355","author":"Bauschke, Heinz H.","year":"2003","journal-title":"Trans. Amer. Math. Soc.","ISSN":"https:\/\/id.crossref.org\/issn\/0002-9947","issn-type":"print"},{"key":"3","series-title":"Texts in Applied Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05089-8","volume-title":"Numerical methods in matrix computations","volume":"59","author":"Bj\u00f6rck, \u00c5ke","year":"2015","ISBN":"https:\/\/id.crossref.org\/isbn\/9783319050881"},{"key":"4","first-page":"487","article-title":"Finding the common point of convex sets by the method of successive projection","volume":"162","author":"Br\u00e8gman, L. M.","year":"1965","journal-title":"Dokl. Akad. Nauk SSSR","ISSN":"https:\/\/id.crossref.org\/issn\/0002-3264","issn-type":"print"},{"issue":"4","key":"5","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1137\/1023097","article-title":"Row-action methods for huge and sparse systems and their applications","volume":"23","author":"Censor, Yair","year":"1981","journal-title":"SIAM Rev.","ISSN":"https:\/\/id.crossref.org\/issn\/1095-7200","issn-type":"print"},{"key":"6","series-title":"CMS Books in Mathematics\/Ouvrages de Math\\'{e}matiques de la SMC","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9298-9","volume-title":"Best approximation in inner product spaces","volume":"7","author":"Deutsch, Frank","year":"2001","ISBN":"https:\/\/id.crossref.org\/isbn\/0387951563"},{"issue":"3","key":"7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0377-0427(89)90296-3","article-title":"Acceleration schemes for the method of alternating projections","volume":"26","author":"Gearhart, William B.","year":"1989","journal-title":"J. Comput. Appl. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0377-0427","issn-type":"print"},{"key":"8","doi-asserted-by":"crossref","unstructured":"R. Gordon, R. Bender, and G. T. Herman, Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and x-ray photography, J. Theor. Biol. 29 (1970), no. 3, 471\u2013481.","DOI":"10.1016\/0022-5193(70)90109-8"},{"issue":"4","key":"9","doi-asserted-by":"publisher","first-page":"1660","DOI":"10.1137\/15M1025487","article-title":"Randomized iterative methods for linear systems","volume":"36","author":"Gower, Robert M.","year":"2015","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"issue":"1","key":"10","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1137\/19M1307044","article-title":"Greed works: an improved analysis of sampling Kaczmarz-Motzkin","volume":"3","author":"Haddock, Jamie","year":"2021","journal-title":"SIAM J. Math. Data Sci."},{"issue":"2","key":"11","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10543-018-0737-6","article-title":"On Motzkin\u2019s method for inconsistent linear systems","volume":"59","author":"Haddock, Jamie","year":"2019","journal-title":"BIT","ISSN":"https:\/\/id.crossref.org\/issn\/0006-3835","issn-type":"print"},{"issue":"1","key":"12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s11075-017-0430-x","article-title":"AIR Tools II: algebraic iterative reconstruction methods, improved implementation","volume":"79","author":"Hansen, Per Christian","year":"2018","journal-title":"Numer. Algorithms","ISSN":"https:\/\/id.crossref.org\/issn\/1017-1398","issn-type":"print"},{"key":"13","unstructured":"S. Kaczmarz, Angen\u00e4herte Aufl\u00f6sung von Systemen linearer Gleichungen, Bull. Int. Acad. Polon. Sci. A 35 (1937), 355\u2013357."},{"key":"14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.4153\/cjm-1954-038-x","article-title":"The relaxation method for linear inequalities","volume":"6","author":"Motzkin, T. S.","year":"1954","journal-title":"Canad. J. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0008-414X","issn-type":"print"},{"issue":"4","key":"15","doi-asserted-by":"publisher","first-page":"1425","DOI":"10.1137\/19M1251643","article-title":"Faster randomized block Kaczmarz algorithms","volume":"40","author":"Necoara, Ion","year":"2019","journal-title":"SIAM J. Matrix Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0895-4798","issn-type":"print"},{"key":"16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.laa.2012.12.022","article-title":"Paved with good intentions: analysis of a randomized block Kaczmarz method","volume":"441","author":"Needell, Deanna","year":"2014","journal-title":"Linear Algebra Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/0024-3795","issn-type":"print"},{"issue":"332","key":"17","doi-asserted-by":"publisher","first-page":"2815","DOI":"10.1090\/mcom\/3644","article-title":"A weighted randomized Kaczmarz method for solving linear systems","volume":"90","author":"Steinerberger, Stefan","year":"2021","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"2","key":"18","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/s00041-008-9030-4","article-title":"A randomized Kaczmarz algorithm with exponential convergence","volume":"15","author":"Strohmer, Thomas","year":"2009","journal-title":"J. Fourier Anal. Appl.","ISSN":"https:\/\/id.crossref.org\/issn\/1069-5869","issn-type":"print"},{"issue":"2","key":"19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.orl.2020.12.007","article-title":"Gearhart-Koshy acceleration for affine subspaces","volume":"49","author":"Tam, Matthew K.","year":"2021","journal-title":"Oper. Res. Lett.","ISSN":"https:\/\/id.crossref.org\/issn\/0167-6377","issn-type":"print"},{"key":"20","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01436376","article-title":"Projection method for solving a singular system of linear equations and its applications","volume":"17","author":"Tanabe, Kunio","year":"1971","journal-title":"Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0029-599X","issn-type":"print"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.ams.org\/mcom\/2023-92-341\/S0025-5718-2023-03818-2\/S0025-5718-2023-03818-2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T04:54:07Z","timestamp":1776833647000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2023-92-341\/S0025-5718-2023-03818-2\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,2]]},"references-count":20,"journal-issue":{"issue":"341","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["S0025-5718-2023-03818-2"],"URL":"https:\/\/doi.org\/10.1090\/mcom\/3818","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2023,2,2]]}}}