On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
From MaRDI portal
Publication:4975938
DOI10.1109/TIT.2009.2021377zbMath1367.94081OpenAlexW2161431029MaRDI QIDQ4975938
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2009.2021377
Nonlinear programming (90C30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (45)
A new result on recovery sparse signals using orthogonal matching pursuit ⋮ Signal recovery under cumulative coherence ⋮ The Moreau envelope based efficient first-order methods for sparse recovery ⋮ A survey on compressive sensing: classical results and recent advancements ⋮ Sparse signal recovery via non-convex optimization and overcomplete dictionaries ⋮ Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization ⋮ Improved RIP conditions for compressed sensing with coherent tight frames ⋮ Relaxed sparse eigenvalue conditions for sparse estimation via non-convex regularized regression ⋮ The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector ⋮ Non-Cartesian spiral binary sensing matrices ⋮ \(\ell_{1}\)-penalization for mixture regression models ⋮ Iterative hard thresholding for compressed data separation ⋮ Sparse estimation via lower-order penalty optimization methods in high-dimensional linear regression ⋮ On the conditions used to prove oracle results for the Lasso ⋮ PAC-Bayesian bounds for sparse regression estimation with exponential weights ⋮ Recovery of signals under the condition on RIC and ROC via prior support information ⋮ Robustness of orthogonal matching pursuit under restricted isometry property ⋮ Analysis of orthogonal multi-matching pursuit under restricted isometry property ⋮ Sharp fixed \(n\) bounds and asymptotic expansions for the mean and the median of a Gaussian sample maximum, and applications to the Donoho-Jin model ⋮ Signal recovery under mutual incoherence property and oracle inequalities ⋮ Parameter estimation and signal reconstruction ⋮ Fast Thresholding Algorithms with Feedbacks and Partially Known Support for Compressed Sensing ⋮ Consistent parameter estimation for Lasso and approximate message passing ⋮ Sharp RIP bound for sparse signal and low-rank matrix recovery ⋮ Stable restoration and separation of approximately sparse signals ⋮ Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO ⋮ Properties and iterative methods for the \(Q\)-lasso ⋮ Compressed data separation via dual frames based split-analysis with Weibull matrices ⋮ Chaotic Binary Sensing Matrices ⋮ Compressed sensing ⋮ Necessary and sufficient conditions for linear convergence of ℓ1-regularization ⋮ SRMD: sparse random mode decomposition ⋮ Joint sparse optimization: lower-order regularization method and application in cell fate conversion ⋮ \(k\) block sparse vector recovery via block \(\ell_1-\ell_2\) minimization ⋮ Sparse recovery via differential inclusions ⋮ Constrained mix sparse optimization via hard thresholding pursuit ⋮ Convergence on thresholding-based algorithms for dictionary-sparse recovery ⋮ Efficiency of orthogonal super greedy algorithm under the restricted isometry property ⋮ Structured iterative hard thresholding with on- and off-grid applications ⋮ EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION ⋮ A modified primal-dual method with applications to some sparse recovery problems ⋮ ROP: matrix recovery via rank-one projections ⋮ Generalization bounds for sparse random feature expansions ⋮ Sparse recovery of sound fields using measurements from moving microphones ⋮ Optimal \(D\)-RIP bounds in compressed sensing
This page was built for publication: On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
