Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing
From MaRDI portal
Publication:1979938
DOI10.1016/j.acha.2021.06.006OpenAlexW3180120565MaRDI QIDQ1979938
Publication date: 3 September 2021
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.05873
Related Items
Low-rank matrix recovery problem minimizing a new ratio of two norms approximating the rank function then using an ADMM-type solver with applications ⋮ Sorted \(L_1/L_2\) minimization for sparse signal recovery ⋮ A wonderful triangle in compressed sensing
Uses Software
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A unified approach to model selection and sparse recovery using regularized least squares
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Iterative hard thresholding for compressed sensing
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations
- Ratio and difference of \(l_1\) and \(l_2\) norms and sparse representation with coherent dictionaries
- Reconstruction of jointly sparse vectors via manifold optimization
- On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms
- Estimation in High Dimensions: A Geometric Perspective
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications
- Computational Advertising: Techniques for Targeting Relevant Ads
- Compressed sensing and best 𝑘-term approximation
- NORMS OF RANDOM MATRICES AND WIDTHS OF FINITE-DIMENSIONAL SETS
- On sparse reconstruction from Fourier and Gaussian measurements
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Smallest singular value of a random rectangular matrix
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Uncertainty principles and ideal atomic decomposition
- High-Dimensional Probability
- Sparse Approximate Solutions to Linear Systems
- Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization
- Accelerated Schemes for the $L_1/L_2$ Minimization
- A Scale-Invariant Approach for Sparse Signal Recovery
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization
- Compressed sensing
