The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing

DOI10.1007/s11075-021-01227-1zbMath1496.94015OpenAlexW4210526284MaRDI QIDQ2672726

Yanyan Li

Publication date: 13 June 2022

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-021-01227-1

zbMATH Keywords

feedbackthresholdingcompressed sensingsparse signalnull space tuning

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Uses Software

• PDCO
• CoSaMP

Cites Work

• Image deblurring by sparsity constraint on the Fourier coefficients
• Recovery of sparsest signals via \(\ell^q \)-minimization
• Iterative hard thresholding for compressed sensing
• Iterative thresholding for sparse approximations
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Hard thresholding pursuit algorithms: number of iterations
• The restricted isometry property and its implications for compressed sensing
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Spark-level sparsity and the \(\ell_1\) tail minimization
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Spectral compressive sensing
• Fast thresholding algorithms with feedbacks for sparse signal recovery
• Lanczos method for large-scale quaternion singular value decomposition
• Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
• Atomic Decomposition by Basis Pursuit
• A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery
• Robust principal component analysis?
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
• Decoding by Linear Programming
• Greed is Good: Algorithmic Results for Sparse Approximation
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Iteratively reweighted least squares minimization for sparse recovery
• Does $\ell _{p}$ -Minimization Outperform $\ell _{1}$ -Minimization?
• A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
• Generalized Orthogonal Matching Pursuit
• Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
• Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing
• CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
• Sparse Approximate Solutions to Linear Systems
• Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• The Improved Bounds of Restricted Isometry Constant for Recovery via <formula formulatype="inline"><tex Notation="TeX">$\ell_{p}$</tex> </formula>-Minimization
• A sparse signal reconstruction perspective for source localization with sensor arrays
• Image Super-Resolution Via Sparse Representation
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing