The block Kaczmarz method is an iterative scheme for solving overdetermined least-squares
problems. At each step, the algorithm projects the current iterate onto the solution space of a …

We present a randomized iterative algorithm that exponentially converges in the mean
square to the minimum \ell_2-norm least squares solution of a given linear system of …

The Kaczmarz and Gauss--Seidel methods both solve a linear system Xβ=y by iteratively
refining the solution estimate. Recent interest in these methods has been sparked by a proof …

The Kaczmarz method is an iterative method for solving overcomplete linear systems of
equations A x= b. The randomized version of the Kaczmarz method put forth by Strohmer …

The randomized version of the Kaczmarz method for the solution of consistent linear
systems is known to converge linearly in expectation. And even in the possibly inconsistent …

We combine two iterative algorithms for solving large-scale systems of linear inequalities:
the relaxation method of Agmon, Motzkin, et al. and the randomized Kaczmarz method. We …

The randomized Kaczmarz (RK) method is an iterative method for approximating the least-
squares solution of large linear systems of equations. The standard RK method uses …

Often in applications ranging from medical imaging and sensor networks to error correction
and data science (and beyond), one needs to solve large-scale linear systems in which a …

Stochastic iterative algorithms have gained recent interest in machine learning and signal
processing for solving large-scale systems of equations, Ax=b. One such example is the …

Tensor recovery has recently arisen in a lot of application fields, such as transportation,
medical imaging, and remote sensing. Under the assumption that signals possess sparse …