Sparse regularization on thin grids. I: The \textsc{Lasso}.
From MaRDI portal
Publication:5268474
Recommendations
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
- Spike detection from inaccurate samplings
- On the sparsity of Lasso minimizers in sparse data recovery
- Stable Recovery of Sparse Signals Via Regularized Minimization
- Exact support recovery for sparse spikes deconvolution
Cited in
(32)- Sparse support recovery using correlation information in the presence of additive noise
- Maximal solutions of sparse analysis regularization
- Super-resolution for doubly-dispersive channel estimation
- Sparsest piecewise-linear regression of one-dimensional data
- TV-based spline reconstruction with Fourier measurements: uniqueness and convergence of grid-based methods
- Degrees of freedom for off-the-grid sparse estimation
- Local behavior of sparse analysis regularization: applications to risk estimation
- Multi-kernel unmixing and super-resolution using the modified matrix pencil method
- Spike detection from inaccurate samplings
- The geometry of off-the-grid compressed sensing
- On the sparsity of Lasso minimizers in sparse data recovery
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
- MultiDimensional Sparse Super-Resolution
- The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem
- Low noise sensitivity analysis of _q-minimization in oversampled systems
- On the uniqueness of solutions for the basis pursuit in the continuum
- TV-based reconstruction of periodic functions
- Sensitivity of _1 minimization to parameter choice
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Modern regularization methods for inverse problems
- Sparse spikes super-resolution on thin grids II: the continuous basis pursuit
- ``FISTA in Banach spaces with adaptive discretisations
- Smooth over-parameterized solvers for non-smooth structured optimization
- Proximal methods for point source localisation
- Identifying the source term in the potential equation with weighted sparsity regularization
- Simultaneous off-the-grid learning of mixtures issued from a continuous dictionary
- Box Constraints and Weighted Sparsity Regularization for Identifying Sources in Elliptic PDEs
- Weighting operators for sparsity regularization
- Off-the-grid regularisation for Poisson inverse problems
- Convergence analysis of the discretization of continuous-domain inverse problems
- A -convergence result and an off-the-grid charge algorithm for curve reconstruction in inverse problems
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications
This page was built for publication: Sparse regularization on thin grids. I: The \textsc{Lasso}.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268474)