Grid is good. Adaptive refinement algorithms for off-the-grid total variation minimization
From MaRDI portal
Cites work
- A measure space approach to optimal source placement
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- An introduction to polynomial and semi-algebraic optimization
- Branch-and-Bound Methods: A Survey
- Compressed Sensing Off the Grid
- CVXPY: a Python-embedded modeling language for convex optimization
- Exact reconstruction using Beurling minimal extrapolation
- Exact solutions of infinite dimensional total-variation regularized problems
- Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
- Exact support recovery for sparse spikes deconvolution
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 3822547 (Why is no real title available?)
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 3016366 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Inverse problems in spaces of measures
- Linear convergence of accelerated conditional gradient algorithms in spaces of measures
- On representer theorems and convex regularization
- On the linear convergence rates of exchange and continuous methods for total variation minimization
- Optimal control of the undamped linear wave equation with measure valued controls
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- Scalable semidefinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Sparse inverse problems over measures: equivalence of the conditional gradient and exchange methods
- Sparse optimization on measures with over-parameterized gradient descent
- Splines are universal solutions of linear inverse problems with generalized TV regularization
- 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
- TV-based spline reconstruction with Fourier measurements: uniqueness and convergence of grid-based methods
- Variational Analysis in Sobolev and BV Spaces
This page was built for publication: Grid is good. Adaptive refinement algorithms for off-the-grid total variation minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6992010)
