Sparse signal recovery with prior information by iterative reweighted least squares algorithm
From MaRDI portal
Publication:1746492
DOI10.1515/jiip-2016-0087zbMath1388.49027OpenAlexW2966767600MaRDI QIDQ1746492
Nianci Feng, Wendong Wang, Jian-Jun Wang
Publication date: 25 April 2018
Published in: Journal of Inverse and Ill-Posed Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jiip-2016-0087
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05) Acceleration of convergence in numerical analysis (65B99)
Related Items
A perturbation analysis based on group sparse representation with orthogonal matching pursuit, Nonparametric blind super-resolution using adaptive heavy-tailed priors, Robust signal recovery for ℓ 1–2 minimization via prior support information
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- 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\)
- An affine scaling methodology for best basis selection
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
- Restricted isometry properties and nonconvex compressive sensing
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Iteratively reweighted least squares minimization for sparse recovery
- Compressive Sensing Reconstruction With Prior Information by Iteratively Reweighted Least-Squares
- Compressed sensing
