A sparse Kaczmarz solver and a linearized Bregman method for online compressed sensing
classification
🧮 math.OC
cs.CVcs.ITmath.ITmath.NA
keywords
frameworkkaczmarzmethodsparsealgorithmicbregmancompressedlinear
pith:345YRZ65 Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{345YRZ65}
Prints a linked pith:345YRZ65 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
An algorithmic framework to compute sparse or minimal-TV solutions of linear systems is proposed. The framework includes both the Kaczmarz method and the linearized Bregman method as special cases and also several new methods such as a sparse Kaczmarz solver. The algorithmic framework has a variety of applications and is especially useful for problems in which the linear measurements are slow and expensive to obtain. We present examples for online compressed sensing, TV tomographic reconstruction and radio interferometry.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.