We consider the block Bregman–Kaczmarz method for finite dimensional linear inverse
problems. The block Bregman–Kaczmarz method uses blocks of the linear system and …

This paper studies the effect of adding geometrically smoothed momentum to the
randomized Kaczmarz algorithm, which is an instance of stochastic gradient descent on a …

We study a version of the randomized Kaczmarz algorithm for solving systems of linear
equations where the iterates are confined to the solution space of a selected subsystem. We …

Sparse and low rank tensor recovery has emerged as a significant area of research with
applications in many fields such as computer vision. However, minimizing the $\ell_0 $-norm …

Linear inverse problems arise in many practical applications. In the present work, we
propose a residual-based surrogate hyperplane Bregman-Kaczmarz method (RSHBK) for …

Large-scale systems of linear equations arise in machine learning, medical imaging, sensor
networks, and in many areas of data science. When the scale of the systems are extreme, it …

The downside of increasing the resolution of surface scanning devices is that the amount of
acquired data makes the morphological analysis of the scanned surfaces computationally …

Let be invertible, unknown, and given. We are interested in approximate solutions: vectors
such that is small. We prove that for all, there is a composition of orthogonal projections onto …

The Kaczmarz method is a way to iteratively solve a linear system of equations $ Ax= b $.
One interprets the solution $ x $ as the point where hyperplanes intersect and then …