Heavy-ball enhanced pseudo-inverse-based hard thresholding algorithms for sparse linear inverse problems

DOI10.1088/1361-6420/ADE180MaRDI QIDQ6965555zbMATH OpenFDO

Authors Jinming Wen, Junhua He, Zihao He, Xiaoli Liu

Publication date 3 July 2025

Published in Inverse Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/1361-6420/ADE180

zbMATH Keywords

restricted isometry propertysparse linear inverse problemsheavy-ball enhanced pseudo-inverse-based hard thresholding (HBPHT)heavy-ball enhanced pseudo-inverse-based hard thresholding pursuit (HBPHP)

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Random matrices (probabilistic aspects) (60B20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Iterative numerical methods for linear systems (65F10) Combinatorial probability (60C05)

Cites work

• scientific article; zbMATH DE number 3111121 (Why is no real title available?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Compressed sensing
• Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing
• Decoding by Linear Programming
• Distributed Heavy-Ball: A Generalization and Acceleration of First-Order Methods With Gradient Tracking
• Hard thresholding pursuit: an algorithm for compressive sensing
• Heavy-ball-based hard thresholding algorithms for sparse signal recovery
• Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms
• Iterative hard thresholding for compressed sensing
• Linearized Bregman iterations for compressed sensing
• Matching pursuits with time-frequency dictionaries
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Nearly Optimal Bounds for Orthogonal Least Squares
• Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery
• On random ±1 matrices: Singularity and determinant
• Optimal Solutions to a Linear Inverse Problem in Geophysics
• Performance comparisons of greedy algorithms in compressed sensing.
• Random matrices: The distribution of the smallest singular values
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Signal-Dependent Performance Analysis of Orthogonal Matching Pursuit for Exact Sparse Recovery
• Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
• Statistical analyses on time complexity and rank consistency between singular value decomposition and the duality approach in AHP: a case study of faculty member selection
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
• The restricted isometry property and its implications for compressed sensing

Cited in

(2)

• A new framework for compressed sensing by p-concave functions
• General decomposition pursuit algorithm for linear inverse problems

This page was built for publication: Heavy-ball enhanced pseudo-inverse-based hard thresholding algorithms for sparse linear inverse problems

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