Abstract The Bregman-Kaczmarz method is an iterative method which can solve strongly
convex problems with linear constraints and uses only one or a selected number of rows of …

Abstract The Sparse Kaczmarz method is a famous and widely used iterative method for
solving the regularized basis pursuit problem. A general scheme of the surrogate …

A greedy average block sparse Kaczmarz method is developed for the sparse solution of the
linear system of equations. The convergence theory of this method is established and the …

In this paper, we propose a novel adaptive stochastic extended iterative method, which can
be viewed as an improved extension of the randomized extended Kaczmarz (REK) method …

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

The Kaczmarz method and its variants, which are types of stochastic gradient descent (SGD)
methods, have been extensively studied for their simplicity and efficiency in solving linear …