On the linear convergence rates of exchange and continuous methods for total variation minimization
From MaRDI portal
Publication:2235147
Abstract: We analyze an exchange algorithm for the numerical solution total-variation regularized inverse problems over the space M() of Radon measures on a subset of R d. Our main result states that under some regularity conditions, the method eventually converges linearly. Additionally, we prove that continuously optimizing the amplitudes of positions of the target measure will succeed at a linear rate with a good initialization. Finally, we propose to combine the two approaches into an alternating method and discuss the comparative advantages of this approach.
Recommendations
- Linearized primal-dual methods for linear inverse problems with total variation regularization and finite element discretization
- Linear convergence analysis of the use of gradient projection methods on total variation problems
- A note on convergence of solutions of total variation regularized linear inverse problems
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- An algorithm for total variation regularization in high-dimensional linear problems
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- scientific article; zbMATH DE number 3013686 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- Atomic decomposition by basis pursuit
- Compressed Sensing Off the Grid
- Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
- Exact reconstruction using Beurling minimal extrapolation
- Exact solutions of infinite dimensional total-variation regularized problems
- Exact support recovery for sparse spikes deconvolution
- Gradient methods for minimizing composite functions
- Inverse problems in spaces of measures
- Linear convergence of accelerated conditional gradient algorithms in spaces of measures
- Modifications of the First Remez Algorithm
- On representer theorems and convex regularization
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Sampling the Fourier transform along radial lines
- Semi-Infinite Programming: Theory, Methods, and Applications
- Sparse inverse problems over measures: equivalence of the conditional gradient and exchange methods
- Spline solutions to L\(^1\) extremal problems in one and several variables
- Splines are universal solutions of linear inverse problems with generalized TV regularization
- The alternating descent conditional gradient method for sparse inverse problems
- The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Towards a Mathematical Theory of Super‐resolution
Cited in
(18)- Super-resolution of positive sources on an arbitrarily fine grid
- scientific article; zbMATH DE number 1829138 (Why is no real title available?)
- Linear convergence of accelerated conditional gradient algorithms in spaces of measures
- Linear convergence analysis of the use of gradient projection methods on total variation problems
- Localization of point scatterers via sparse optimization on measures
- A fast Primal-Dual-Active-Jump method for minimization in $\operatorname{BV}((0,T);\mathbb{R}^d)$
- Linearized primal-dual methods for linear inverse problems with total variation regularization and finite element discretization
- A generalized conditional gradient method for dynamic inverse problems with optimal transport regularization
- Sparsest piecewise-linear regression of one-dimensional data
- Nonconvex regularization for sparse neural networks
- TV-based reconstruction of periodic functions
- TV-based spline reconstruction with Fourier measurements: uniqueness and convergence of grid-based methods
- On the uniqueness of solutions for the basis pursuit in the continuum
- Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
- Proximal methods for point source localisation
- Dynamical programming for off-the-grid dynamic inverse problems
- Explicit representations for Banach subspaces of Lizorkin distributions
- Sparse optimization on measures with over-parameterized gradient descent
This page was built for publication: On the linear convergence rates of exchange and continuous methods for total variation minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235147)
