Required Number of Iterations for Sparse Signal Recovery via Orthogonal Least Squares

DOI10.4208/JCM.2104-M2020-0093MaRDI QIDQ5881245zbMATH OpenOpenAlexFDO

Authors

Publication date 9 March 2023

Published in Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/jcm.2104-m2020-0093

zbMATH Keywords

orthogonal least squares (OLS)restricted isometry property (RIP)sparse signal recovery

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical solution to inverse problems in abstract spaces (65J22) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• A new sufficient condition for sparse recovery with multiple orthogonal least squares
• Perturbation Analysis of Orthogonal Least Squares
• Nearly optimal number of iterations for sparse signal recovery with orthogonal multi-matching pursuit ^*
• Analysis of the modified multiple OLS (m^2OLS) algorithm for sparse signal recovery with noise
• Sparsity and incoherence in orthogonal matching pursuit

Cites work

• 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
• A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
• A simple proof of the restricted isometry property for random matrices
• Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
• Atomic decomposition by basis pursuit
• Compressed sensing
• Decoding by Linear Programming
• Exact Recovery Conditions for Sparse Representations With Partial Support Information
• Exact Recovery of Sparse Signals Using Orthogonal Matching Pursuit: How Many Iterations Do We Need?
• Joint <formula formulatype="inline"><tex Notation="TeX">$k$</tex> </formula>-Step Analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares
• Nearly Optimal Bounds for Orthogonal Least Squares
• Orthogonal least squares methods and their application to non-linear system identification
• Orthogonal matching pursuit under the restricted isometry property
• Perturbation Analysis of Orthogonal Least Squares
• Recovery of Sparse Signals Using Multiple Orthogonal Least Squares
• Recovery of Sparse Signals via Generalized Orthogonal Matching Pursuit: A New Analysis
• Relaxed Recovery Conditions for OMP/OLS by Exploiting Both Coherence and Decay
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Robustness of orthogonal matching pursuit under restricted isometry property
• Robustness properties of dimensionality reduction with Gaussian random matrices
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP
• Sparsity and incoherence in compressive sampling

Cited in

(3)

• Perturbation Analysis of Orthogonal Least Squares
• Nearly optimal number of iterations for sparse signal recovery with orthogonal multi-matching pursuit ^*
• A fixed-time converging neurodynamic approach with time-varying coefficients for l₁-minimization problem

Describes a project that uses

Uses Software

• PDCO

This page was built for publication: Required Number of Iterations for Sparse Signal Recovery via Orthogonal Least Squares

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