Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery
From MaRDI portal
Publication:2238869
DOI10.1016/j.laa.2021.08.024zbMath1479.90156OpenAlexW3196590255MaRDI QIDQ2238869
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
noiseblock restricted isometry propertyblock sparse recoveryiteratively reweighted least squares algorithm
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Matrix completion problems (15A83)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Block sparse recovery via mixed \(l_2/l_1\) minimization
- 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
- The restricted isometry property and its implications for compressed sensing
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- 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
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Graph Implementations for Nonsmooth Convex Programs
- Sparse Optimization with Least-Squares Constraints
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Decoding by Linear Programming
- Iteratively reweighted least squares minimization for sparse recovery
- Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
- High-Resolution Radar via Compressed Sensing
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals
- Adaptive Compressed Sensing Radar Oriented Toward Cognitive Detection in Dynamic Sparse Target Scene
- Convergence and Stability of Iteratively Re-weighted Least Squares Algorithms
- Iterative Reweighted <formula formulatype="inline"><tex Notation="TeX">$\ell_{2}/\ell_{1}$</tex> </formula> Recovery Algorithms for Compressed Sensing of Block Sparse Signals
- Robust Recovery of Signals From a Structured Union of Subspaces
- The High Order Block RIP Condition for Signal Recovery
- On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
This page was built for publication: Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery