Recovery of high-dimensional sparse signals via _1-minimization
From MaRDI portal
Publication:364458
DOI10.1155/2013/636094zbMATH Open1273.62148OpenAlexW2046688153WikidataQ59003488 ScholiaQ59003488MaRDI QIDQ364458FDOQ364458
Authors: Limin Su, Shiqing Wang 
Publication date: 9 September 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/636094
Recommendations
- The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization
- Stable Recovery of Sparse Signals Via Regularized Minimization
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Signal recovery under mutual incoherence property and oracle inequalities
Cites Work
- Title not available (Why is that?)
- Simultaneous analysis of Lasso and Dantzig selector
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Compressive sampling
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Just relax: convex programming methods for identifying sparse signals in noise
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Stable signal recovery from incomplete and inaccurate measurements
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- On Sparse Representations in Arbitrary Redundant Bases
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Uncertainty principles and ideal atomic decomposition
- Sparse representations in unions of bases
- The restricted isometry property and its implications for compressed sensing
- Shifting Inequality and Recovery of Sparse Signals
- New Bounds for Restricted Isometry Constants
- The oracle inequalities on simultaneous Lasso and Dantzig selector in high-dimensional nonparametric regression
- Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Stable Recovery of Sparse Signals and an Oracle Inequality
Cited In (16)
- Recovery of partly sparse and dense signals
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Missing Data Recovery for High-Dimensional Signals With Nonlinear Low-Dimensional Structures
- Signal recovery under cumulative coherence
- Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
- Local restrained condition on sparse recovery in the high dimensional linear regression
- What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Weaker regularity conditions and sparse recovery in high-dimensional regression
- Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
- An improved condition of sparse signal reconstruction via \({l_1}\)-\({l_2}\) norm minimization
- Signal recovery under mutual incoherence property and oracle inequalities
- Note on sparsity in signal recovery and in matrix identification
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
This page was built for publication: Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364458)
