Theoretical analysis of weighted _1 and _1-2-minimization with multiple weighting sets
From MaRDI portal
Publication:6880460
Cites work
- A mathematical introduction to compressive sensing
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
- A new sufficient condition for sparse vector recovery via _1- _2 local minimization
- A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
- An improved bound of cumulative coherence for signal recovery
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Recovering Compressively Sampled Signals Using Partial Support Information
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Signal recovery under cumulative coherence
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable Recovery of Sparse Signals and an Oracle Inequality
- The restricted isometry property and its implications for compressed sensing
- Uncertainty principles and ideal atomic decomposition
- Weighted \(\ell_1\)-minimization for sparse recovery under arbitrary prior information
- Weighted \(\ell_p\) (\(0<p\le 1\)) minimization with non-uniform weights for sparse recovery under partial support information
This page was built for publication: Theoretical analysis of weighted \(\ell_1\) and \(\ell_{1-2}\)-minimization with multiple weighting sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880460)
