The geometry of off-the-grid compressed sensing
From MaRDI portal
Publication:2684465
Recommendations
Cites work
- A continuous exact _0 penalty (CEL0) for least squares regularized problem
- A mathematical introduction to compressive sensing
- A multivariate generalization of Prony's method
- A Probabilistic and RIPless Theory of Compressed Sensing
- An elementary proof of a theorem of Johnson and Lindenstrauss
- An Extended Cencov Characterization of the Information Metric
- Atomic decomposition by basis pursuit
- Breaking the curse of dimensionality with convex neural networks
- Classical and quantum Fisher information in the geometrical formulation of quantum mechanics
- Compressed sensing
- Compressed Sensing Off the Grid
- Convergence rates of convex variational regularization
- Exact reconstruction using Beurling minimal extrapolation
- Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
- Exact support recovery for sparse spikes deconvolution
- Fisher information distance: a geometrical reading
- Free boundaries in optimal transport and Monge-Ampère obstacle problems
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 3761167 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3106666 (Why is no real title available?)
- Inverse problems in spaces of measures
- MultiDimensional Sparse Super-Resolution
- MUSIC for single-snapshot spectral estimation: stability and super-resolution
- On some extensions of Bernstein's inequality for self-adjoint operators
- Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Prony's method in several variables
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse regularization on thin grids. I: The \textsc{Lasso}.
- Spike detection from inaccurate samplings
- Super-resolution from noisy data
- Superresolution without separation
- Support recovery for sparse super-resolution of positive measures
- Synopses for massive data: samples, histograms, wavelets, sketches
- The alternating descent conditional gradient method for sparse inverse problems
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Towards a Mathematical Theory of Super‐resolution
- Unbalanced optimal transport: dynamic and Kantorovich formulations
Cited in
(13)- A geometrical stability condition for compressed sensing
- The Geometry of Compressed Sensing
- ``FISTA in Banach spaces with adaptive discretisations
- Convergence rates of gradient methods for convex optimization in the space of measures
- The geometry of off-the-grid compressed sensing
- Localization of point scatterers via sparse optimization on measures
- Simultaneous off-the-grid learning of mixtures issued from a continuous dictionary
- Exact recovery of the support of piecewise constant images via total variation regularization
- Super-resolved Lasso
- No-gap second-order conditions for minimization problems in spaces of measures
- Sampling theory for super-resolution with implicit neural representations
- A general theory for exact sparse representation recovery in convex optimization
- Effective regions and kernels in continuous sparse regularization, with application to sketched mixtures
This page was built for publication: The geometry of off-the-grid compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2684465)
