Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery
DOI10.1016/J.LAA.2021.08.024zbMATH Open1479.90156OpenAlexW3196590255MaRDI QIDQ2238869FDOQ2238869
Publication date: 2 November 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2021.08.024
Recommendations
- Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery
- Sparse signal recovery with prior information by iterative reweighted least squares algorithm
- Iteratively reweighted least squares minimization for sparse recovery
- Recovery analysis for block \(\ell_p-\ell_1\) minimization with prior support information
- Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\)
noiseblock restricted isometry propertyblock sparse recoveryiteratively reweighted least squares algorithm
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Matrix completion problems (15A83)
Cites Work
- Sparse Optimization with Least-Squares Constraints
- Title not available (Why is that?)
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Decoding by Linear Programming
- Title not available (Why is that?)
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Graph implementations for nonsmooth convex programs
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Iteratively reweighted least squares minimization for sparse recovery
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- The restricted isometry property and its implications for compressed sensing
- Low-rank matrix recovery via iteratively reweighted least squares minimization
- Title not available (Why is that?)
- Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
- Block sparse recovery via mixed \(l_2/l_1\) minimization
- Robust Recovery of Signals From a Structured Union of Subspaces
- High-Resolution Radar via Compressed Sensing
- Adaptive Compressed Sensing Radar Oriented Toward Cognitive Detection in Dynamic Sparse Target Scene
- Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals
- On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$
- Improved stability conditions of BOGA for noisy block-sparse signals
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- Convergence and Stability of Iteratively Re-weighted Least Squares Algorithms
- Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery
- A new bound on the block restricted isometry constant in compressed sensing
- Iterative Reweighted <formula formulatype="inline"><tex Notation="TeX">$\ell_{2}/\ell_{1}$</tex> </formula> Recovery Algorithms for Compressed Sensing of Block Sparse Signals
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- The High Order Block RIP Condition for Signal Recovery
Cited In (3)
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Error analysis of reweighted \(l_1\) greedy algorithm for noisy reconstruction
- Iterative Reweighted <formula formulatype="inline"><tex Notation="TeX">$\ell_{2}/\ell_{1}$</tex> </formula> Recovery Algorithms for Compressed Sensing of Block Sparse Signals
Uses Software
This page was built for publication: Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238869)
