A fast randomized Kaczmarz algorithm for sparse solutions of consistent linear systems

Built on

“Angenäherte Auflösung von Systemen linearer Gleichungen.,”
S. Kaczmarz, · 1937
Earlier work this paper cites.
“Algebraic reconstruction techniques (ART) for three-dimensional electron microscopy and x-ray photography.,”
R. Gordon, R. Bender, and G. T. Herman, · 1970
Earlier work this paper cites.
“Singular value inequalities for matrix sums and minors,”
R.C. Thompson, · 1975
Earlier work this paper cites.
“Applications of convex projection theory to image recovery in tomography and related areas,”
K.M. Sezan and H. Stark, · 1987
Earlier work this paper cites.

The Mathematics of Computerized Tomography
F. Natterer, · 2001
Cited alongside, same era.
“Row-action methods for compressed sensing,”
S. Sra and J.A. Tropp, · 2006
Cited alongside, same era.
“Probing the pareto frontier for basis pursuit solutions,”
E. van den Berg and M. P. Friedlander, · 2008
Cited alongside, same era.
“A randomized kaczmarz algorithm with exponential convergence,”
T. Strohmer and R. Vershynin, · 2009
Cited alongside, same era.

“Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma.,”
Y. Eldar and D. Needell, · 2011
Later among the works it cites.
“Almost sure convergence of the kaczmarz algorithm with random measurements,”
X. Chen and A. M. Powell, · 2012
Later among the works it cites.
“Two-subspace projection method for coherent overdetermined systems,”
D. Needell and R. Ward, · 2012
Later among the works it cites.
“Paved with good intentions: Analysis of a randomized block kaczmarz method,”
Original
D. Needell and J. A. Tropp, · 2012
Later among the works it cites.