Iteratively reweighted least squares for block sparse signal recovery with unconstrained \(l_{2,p}\) minimization
From MaRDI portal
Publication:6649926
DOI10.1142/S0219530524500283MaRDI QIDQ6649926
Ruifang Hu, Yun Cai, Qian Zhang
Publication date: 6 December 2024
Published in: Analysis and Applications (Singapore) (Search for Journal in Brave)
block restricted isometry propertyblock sparse recoveryiteratively reweighted least squares algorithmunconstrained \(l_{2, p}\) minimization
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Matrix completion problems (15A83)
Cites Work
- Title not available (Why is that?)
- 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\)
- Group sparse recovery in impulsive noise via alternating direction method of multipliers
- 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
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Restricted isometry properties and nonconvex compressive sensing
- 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
- Robust Recovery of Signals From a Structured Union of Subspaces
- A new sufficient condition for sparse vector recovery via ℓ1 − ℓ2 local minimization
- The High Order Block RIP Condition for Signal Recovery
- On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$
- Weighted lp − l1 minimization methods for block sparse recovery and rank minimization
- Compressed data separation via unconstrained l1-split analysis
This page was built for publication: Iteratively reweighted least squares for block sparse signal recovery with unconstrained \(l_{2,p}\) minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649926)