The sparse Kaczmarz method with surrogate hyperplane for the regularized basis pursuit problem
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 hyperplane sparse Kaczmarz method is proposed. In particular, a class of residual-based surrogate hyperplane sparse Kaczmarz method is introduced and the implementations are well discussed. Their convergence theories are proved and the linear convergence rates are studied and compared in details. Numerical experiments verify the efficiency of the proposed methods.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.