Iterative re-weighted least squares algorithm for l_p-minimization with tight frame and 0 < p 1

DOI10.1016/J.LAA.2019.07.029MaRDI QIDQ2273889zbMATH OpenOpenAlexFDO

Authors Kaihao Liang, Michael J. Clay

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

zbMATH Keywords

\(l_p\)-minimization\(p\)-d-NSPcompressed sensingtight frame

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52) General harmonic expansions, frames (42C15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Information theory (general) (94A15)

Recommendations

• Iteratively reweighted algorithm for signals recovery with coherent tight frame
• Iteratively reweighted least squares minimization for sparse recovery
• Stable recovery of sparse signals with coherent tight frames via l_p-analysis approach
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Improved iteratively reweighted least squares for unconstrained smoothed _q minimization

Cites work

• A simple proof of the restricted isometry property for random matrices
• Compressed sensing
• Compressed sensing with coherent and redundant dictionaries
• Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\)
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure
• scientific article; zbMATH DE number 6276219 (Why is no real title available?)
• Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
• Iteratively reweighted algorithm for signals recovery with coherent tight frame
• Iteratively reweighted least squares minimization for sparse recovery
• Low-rank matrix recovery via iteratively reweighted least squares minimization
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• On sparse reconstruction from Fourier and Gaussian measurements
• Perturbations of measurement matrices and dictionaries in compressed sensing
• Restricted q-Isometry Properties Adapted to Frames for Nonconvex l_q-Analysis
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• Restricted isometry properties and nonconvex compressive sensing
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Stable signal recovery from incomplete and inaccurate measurements

Cited in

(7)

• Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
• Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery
• Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
• An iterative support detection algorithm based on a truncated reweighted basis pursuit model
• A Lorentzian-\(\ell_p\) norm regularization based algorithm for recovering sparse signals in two types of impulsive noise
• Estimation of q for $\ell _{q}$-minimization in signal recovery with tight frame
• Iteratively reweighted least squares for block sparse signal recovery with unconstrained \(l_{2,p}\) minimization

This page was built for publication: Iterative re-weighted least squares algorithm for \(l_p\)-minimization with tight frame and \(0 < p \leq 1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2273889)