Fetching the paper…
Reading the bibliography…
The Kaczmarz method for solving a linear system $Ax = b$ interprets such a system as a collection of equations $\left\langle a_i, x\right\rangle = b_i$, where $a_i$ is the $i-$th row of $A$, then picks such an equation and corrects $x_{k+1} = x_k + \lambda a_i$ where $\lambda$ is chosen so that the $i-$th equation is satisfied.
1909
Earlier work this paper cites.
1912
Earlier work this paper cites.
S. Kaczmarz, Stefan, Angenaherte Auflosung von Systemen linearer Gleichungen, Bulletin International de l’Academie Polonaise des Sciences et des Lettres. Classe des Sciences Mathematiques et Naturelles. Serie A, Sciences Mathematiques, 35 (1937), pp. 355–357
1937
Earlier work this paper cites.
S. Agmon. The relaxation method for linear inequalities. Canadian J. Math. 6, p. 382–392, 1954
1954
Earlier work this paper cites.
R. Gordon, R. Bender and G. Herman, Algebraic reconstruction techniques (ART) for threedimensional electron microscopy and x-ray photography, Journal of Theoretical Biology, 29 (1970): p. 471–481
1970
Earlier work this paper cites.
G.T. Herman. Image reconstruction from projections. Academic Press Inc. [Harcourt Brace Jovanovich Publishers], New York, 1980. The fundamentals of computerized tomography, Computer Science and Applied Mathematics
1980
Earlier work this paper cites.
F. Deutsch. Rate of convergence of the method of alternating projections. Internat. Schriftenreihe Numer. Math., 72 (1985), p.96–107
1985
Earlier work this paper cites.
F. Natterer. The Mathematics of Computerized Tomography. Wiley, New York, 1986
1986
Earlier work this paper cites.
K.M. Sezan and H. Stark. Applications of convex projection theory to image recovery in tomography and related areas. In H. Stark, editor, Image Recovery: Theory and application, pages 415–462. Acad. Press, 1987
1987
Earlier work this paper cites.
C. Cenker, H. G. Feichtinger, M. Mayer, H. Steier, and T. Strohmer, New variants of the POCS method using affine subspaces of finite codimension, with applications to irregular sampling. In Proc. SPIE: Visual Communications and Image Processing, pages 299–310, 1992
1992
Earlier work this paper cites.
H. G. Feichtinger, C. Cenker, M. Mayer, H. Steier and T. Strohmer, New variants of the POCS method using affine subspaces of finite codimension with applications to irregular sampling, Proceedings Volume 1818, Visual Communications and Image Processing(1992)
1992
Earlier work this paper cites.
G. T. Herman and L. B. Meyer. Algebraic reconstruction techniques can be made computationally efficient. IEEE Trans. Medical Imaging, 12 (1993):600–609
1993
Earlier work this paper cites.
F. Deutsch and H. Hundal. The rate of convergence for the method of alternating projections, II. J. Math. Anal. Appl., 205 (1997), p. 381–405
1997
Earlier work this paper cites.
E. L. Piccolomini, and F. Zama. The conjugate gradient regularization method in computed tomography problems. Applied mathematics and computation 102.1 (1999): 87–99
1999
Earlier work this paper cites.
J. Moorman, T. Tu, D. Molitor and D. Needell, Randomized Kaczmarz with Averaging, arXiv:2002.04126
2002
Earlier work this paper cites.
2004
Cited alongside, same era.
A. Galantai. On the rate of convergence of the alternating projection method in finite dimensional ´ spaces. J. Math. Anal. Appl., 310 (2005), p.30–44
2005
Cited alongside, same era.
S. Steinerberger, Randomized Kaczmarz converges along small singular vectors, arXiv:2006.16978
2006
Cited alongside, same era.
T. Strohmer and R. Vershynin, A randomized Kaczmarz algorithm for linear systems with exponential convergence, Journal of Fourier Analysis and Applications, 15 (2009): p. 262–278
2009
Cited alongside, same era.
D. Leventhal and A. S. Lewis, Randomized Methods for Linear Constraints: Convergence Rates and Conditioning, Mathematics of Operation Research, Vol. 35, No. 3, August 2010, pp. 641–654
D. Needell, R. Zhao and A. Zouzias, Randomized block Kaczmarz method with projection for solving least squares, Linear Algebra and its Applications 484 (2015), p. 322–343
2015
Later among the works it cites.
J. Liu and S. Wright, An accelerated randomized Kaczmarz algorithm, Math. Comp. 85 (2016), p. 153-178
2016
Later among the works it cites.
J. Nutini, B. Sepehry, I. Laradji, M. Schmidt, H. Koepke, A. Virani, Convergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph, The 32th Conference on Uncertainty in Artificial Intelligence, 2016
2016
Later among the works it cites.
Y. Jiao, B. Jin and X. Lu, Preasymptotic Convergence of Randomized Kaczmarz Method, Inverse Problems 33 (2017), article: 125012
2017
Later among the works it cites.
Z.-Z. Bai and W.-T. Wu. On greedy randomized Kaczmarz method for solving large sparse linear systems. SIAM Journal on Scientific Computing, 40 (2018): p. 592–606
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
D. Needell. Randomized Kaczmarz solver for noisy linear systems. BIT, 50(2):395–403, 2010
2010
Cited alongside, same era.
Y. C. Eldar and D. Needell. Acceleration of randomized Kaczmarz method via the JohnsonLindenstrauss lemma. Numer. Algorithms, 58(2):p. 163–177, 2011
2011
Cited alongside, same era.
2011
Cited alongside, same era.
Y.-T. Lee and A. Sidford, Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems, FOCS 2013
2013
Cited alongside, same era.
D. Needell and R. Ward, Two-Subspace Projection Method for Coherent Overdetermined Systems, J Fourier Anal Appl 19 (2013), p. 256–269
2013
Cited alongside, same era.
A. Zouzias and N. M. Freris. Randomized extended Kaczmarz for solving least squares. SIAM J. Matrix Anal. Appl., 34(2): p. 773–793, 2013
2013
Cited alongside, same era.
T. Elfving, P.-C. Hansen and T. Nikazad, Semi-convergence properties of Kaczmarz’s method, Inverse Problems 30 (2014), 055007
2014
Cited alongside, same era.
2018
Later among the works it cites.
Z.-Z. Bai and W.-T. Wu, On convergence rate of the randomized Kaczmarz method, Linear Algebra and its Applications 553 (2018), p. 252–269
2018
Later among the works it cites.
Z.-Z. Bai and W.-T. Wu, On relaxed greedy randomized Kaczmarz methods for solvinglarge sparse linear systems, Applied Mathematics Letters 83 (2018), p. 21–26
2018
Later among the works it cites.
D. Gordon, A derandomization approach to recovering bandlimited signals across a wide range of random sampling rates, Numer Algor (2018) 77: p. 1141–1157
2018
Later among the works it cites.
B. Jin, Bangti, and X. Lu. On the regularizing property of stochastic gradient descent. Inverse Problems 35.1 (2018): 015004
2018
Later among the works it cites.
C. Popa, Convergence rates for Kaczmarz-type algorithms, Numer Algor (2018) 79: p. 1–17
2018
Later among the works it cites.
K. Du and H. Gao, A new theoretical estimate for the convergence rate of the maximal weighted residual Kaczmarz algorithm. Numer. Math. Theor. Meth. Appl, 12 (2019): p. 627–639
2019
Later among the works it cites.
J. Haddock and D. Needell, J. Haddock and D. Needell. On Motzkin’s method for inconsistent linear systems. BIT, 59, p. 387–401, 2019
2019
Later among the works it cites.
Y. Li, J. Lu and Z. Wang, Coordinate-Wise Descent Methods for Leading Eigenvalue Problem, SIAM Journal on Scientific Computing 41 (2019), 2681–2716
2019
Later among the works it cites.
Y. Tan and R. Vershynin, Phase retrieval via randomized Kaczmarz: theoretical guarantees, Information and Inference: A Journal of the IMA 8 (2019), p. 97–123
2019
Later among the works it cites.
J.-J. Zhang, A new greedy Kaczmarz algorithm for the solution of very large linear systems, Applied Mathematics Letters 91 (2019), p. 207–212
2019
Later among the works it cites.