2000 character limit reached
A sparse Kaczmarz solver and a linearized Bregman method for online compressed sensing
Published 28 Mar 2014 in math.OC, cs.CV, cs.IT, math.IT, and math.NA | (1403.7543v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.