# Towards Off-the-grid Algorithms for Total Variation Regularized Inverse Problems

arXiv: https://arxiv.org/abs/2104.06706 · HTML: https://mlsanity.com/paper/2104.06706/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 14 Apr 2021.

## Built on by (most cited first, 1 of 1)

- [Fenchel-Young Duality Gaps: Certified Early Stopping for Regularized Inverse Problems](https://mlsanity.com/paper/2609.17629/) (2026)

## Abstract (arXiv)

We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed mesh, our approach exploits the structure of the solutions and consists in iteratively constructing a linear combination of indicator functions of simple polygons.
