Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\)
DOI10.1016/j.laa.2019.07.029zbMath1419.94017OpenAlexW2964601009MaRDI QIDQ2273889
Publication date: 18 September 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.07.029
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) General harmonic expansions, frames (42C15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Random matrices (algebraic aspects) (15B52) Information theory (general) (94A15)
Cites Work
- Unnamed Item
- Perturbations of measurement matrices and dictionaries in compressed sensing
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
- Compressed sensing with coherent and redundant dictionaries
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- A simple proof of the restricted isometry property for random matrices
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Restricted $q$-Isometry Properties Adapted to Frames for Nonconvex $l_q$-Analysis
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Restricted isometry properties and nonconvex compressive sensing
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Iteratively reweighted least squares minimization for sparse recovery
- Iteratively reweighted algorithm for signals recovery with coherent tight frame
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
This page was built for publication: Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\)