A note on guaranteed sparse recovery via _1-minimization
From MaRDI portal
(Redirected from Publication:984666)
A note on guaranteed sparse recovery via \(\ell 1\)-minimization
A note on guaranteed sparse recovery via \(\ell 1\)-minimization
Recommendations
- Recovery of sparsest signals via \(\ell^q \)-minimization
- The restricted isometry property and its implications for compressed sensing
- A new sufficient condition for sparse vector recovery via \(\ell_1\)-\( \ell_2\) local minimization
- On exact recovery of sparse vectors from linear measurements
- Consistency of \(\ell_1\) recovery from noisy deterministic measurements
Cites work
- Decoding by Linear Programming
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Shifting Inequality and Recovery of Sparse Signals
- Sparse representations in unions of bases
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- The restricted isometry property and its implications for compressed sensing
Cited in
(53)- Sparse recovery with coherent frames via \(\ell_{1-2}\)-analysis
- \(k\) block sparse vector recovery via block \(\ell_1-\ell_2\) minimization
- Theory and applications of compressed sensing
- Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions
- Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
- Compressive Sensing
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Recovery of sparsest signals via \(\ell^q \)-minimization
- \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization
- Matrix-free interior point method for compressed sensing problems
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
- Learning functions of few arbitrary linear parameters in high dimensions
- New regularization method and iteratively reweighted algorithm for sparse vector recovery
- k-Sparse Vector Recovery via $$\ell _1-\alpha \ell _2$$ Local Minimization
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Robustness of Sparse Recovery via <inline-formula> <tex-math notation="LaTeX">$F$ </tex-math></inline-formula>-Minimization: A Topological Viewpoint
- Letter to the editor: ``On exact recovery of sparse vectors from linear measurements
- Sparse recovery using the discrete cosine transform
- A new sufficient condition for sparse vector recovery via \(\ell_1\)-\( \ell_2\) local minimization
- A survey on compressive sensing: classical results and recent advancements
- Stable recovery of low-rank matrix via nonconvex Schatten \(p\)-minimization
- Spark-level sparsity and the \(\ell_1\) tail minimization
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Restricted isometries for partial random circulant matrices
- An evaluation of the sparsity degree for sparse recovery with deterministic measurement matrices
- The null space property for sparse recovery from multiple measurement vectors
- Perturbations of measurement matrices and dictionaries in compressed sensing
- A tight bound of modified iterative hard thresholding algorithm for compressed sensing.
- scientific article; zbMATH DE number 7370639 (Why is no real title available?)
- Compressed sensing with coherent and redundant dictionaries
- Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
- On the recovery of an integer vector from linear measurements
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications
- Sparse signal recovery via non-convex optimization and overcomplete dictionaries
- The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
- Improved bounds for restricted isometry constants
- Necessary and sufficient conditions for linear convergence of \(\ell^1\)-regularization
- On support sizes of restricted isometry constants
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Basis adaptive sample efficient polynomial chaos (BASE-PC)
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
- An efficient algorithm based on sparse optimization for the aircraft departure scheduling problem
- Weighted \(\ell_1\)-minimization for sparse recovery under arbitrary prior information
- A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization
- A survey of compressed sensing
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
- New bounds for RIC in compressed sensing
This page was built for publication: A note on guaranteed sparse recovery via \(\ell_1\)-minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984666)