Super-resolved Lasso
From MaRDI portal
Cites work
- A kernel two-sample test
- A mathematical introduction to compressive sensing
- A multivariate generalization of Prony's method
- A review of methods for spike sorting: the detection and classification of neural action potentials
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic decomposition by basis pursuit
- Compressed Sensing Off the Grid
- Consistency of the group Lasso and multiple kernel learning
- Deconvolution of point sources: a sampling theorem and robustness guarantees
- 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
- Gap safe screening rules for sparsity enforcing penalties
- Grid is good. Adaptive refinement algorithms for off-the-grid total variation minimization
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Inverse problems in spaces of measures
- Iteratively reweighted least squares minimization for sparse recovery
- Joint Sparse Recovery Method for Compressed Sensing With Structured Dictionary Mismatches
- Lasso, fractional norm and structured sparse estimation using a Hadamard product parametrization
- Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
- Model Consistency of Partly Smooth Regularizers
- Model Selection and Estimation in Regression with Grouped Variables
- MUSIC for single-snapshot spectral estimation: stability and super-resolution
- Necessary and sufficient conditions for linear convergence of ^1-regularization
- Off-Grid Direction of Arrival Estimation Using Sparse Bayesian Inference
- On Sparse Representations in Arbitrary Redundant Bases
- On the linear convergence rates of exchange and continuous methods for total variation minimization
- Optimization with sparsity-inducing penalties
- Recovery of Sparse Translation-Invariant Signals With Continuous Basis Pursuit
- Robustly Stable Signal Recovery in Compressed Sensing With Structured Matrix Perturbation
- Sharp, strong and unique minimizers for low complexity robust recovery
- Smooth over-parameterized solvers for non-smooth structured optimization
- Sparse spikes super-resolution on thin grids II: the continuous basis pursuit
- Stable super-resolution limit and smallest singular value of restricted Fourier matrices
- Super-resolution from noisy data
- Super-resolution of near-colliding point sources
- Superresolution via Sparsity Constraints
- The alternating descent conditional gradient method for sparse inverse problems
- The basins of attraction of the global minimizers of non-convex inverse problems with low-dimensional models in infinite dimension
- The geometry of off-the-grid compressed sensing
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
- Towards a Mathematical Theory of Super‐resolution
This page was built for publication: Super-resolved Lasso
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909010)