Fetching the paper…
Reading the bibliography…
The randomized Kaczmarz ($\RK$) algorithm is a simple but powerful approach for solving consistent linear systems $Ax=b$.
S. Kaczmarz, Angenaherte auflsung von systemen linearer gleichungen , Bulletin International de l’Acadmie Polonaise des Sciences et des Letters 35
1937
Earlier work this paper cites.
A. J. Hoffman, On approximate solutions of systems of linear inequalities , Journal of Research of the National Bureau of Standards 49
1952
Earlier work this paper cites.
G. T. Herman, Image Reconstruction from Projections: The Fundamentals of Computerized Tomography , Academic Press, 1980
1980
Earlier work this paper cites.
C. Popa, Characterization of the solutions set of least-squares problems by an extension of Kaczmarz’s projections method , Journal of Applied Mathematics and Computing 6
1999
Earlier work this paper cites.
Y. Censor, D. Gordon, and R. Gordon, Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems , Parallel Computing 27
2001
Earlier work this paper cites.
Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course , Kluwer Academic Publishers, 2004
2004
Earlier work this paper cites.
A. Galantai, On the rate of convergence of the alternating projection method in finite dimensional spaces , Journal of Mathematical Analysis and Applications 310
2005
Cited alongside, same era.
J. Nocedal and S. J. Wright, Numerical Optimization , 2nd ed., Springer Verlag, 2006
2006
Cited alongside, same era.
by same author, Fundamentals of Computerized Tomography , Springer, 2009
2009
Cited alongside, same era.
T. Strohmer and R. Vershynin, A randomized Kaczmarz algorithm with exponential convergence , Journal of Fourier Analysis and Applications 15
2009
Cited alongside, same era.
D. Leventhal and A. S. Lewis, Randomized methods for linear constraints: Convergence rates and conditioning , Mathematics of Operations Research 35
2010
Cited alongside, same era.
D. Needell, Randomized Kaczmarz solver for noisy linear systems , BIT Numerical Mathematics 50
2010
Later among the works it cites.
Y. C. Eldar and D. Needell, Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma , Numerical Algorithms 58
2011
Later among the works it cites.
2011
Later among the works it cites.
Y. Nesterov, Efficiency of coordinate descent methods on huge-scale optimization problems , SIAM Journal on Optimization 22
2012
Later among the works it cites.
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…