Heavy-ball-based hard thresholding algorithms for sparse signal recovery

From MaRDI portal
Publication:6137779

DOI10.1016/J.CAM.2023.115264zbMATH Open1520.94023arXiv2204.09300OpenAlexW4366166383MaRDI QIDQ6137779FDOQ6137779

Nan Meng, Zhongfeng Sun, Jinchuan Zhou, Yun-Bin Zhao

Publication date: 4 September 2023

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Abstract: The hard thresholding technique plays a vital role in the development of algorithms for sparse signal recovery. By merging this technique and heavy-ball acceleration method which is a multi-step extension of the traditional gradient descent method, we propose the so-called heavy-ball-based hard thresholding (HBHT) and heavy-ball-based hard thresholding pursuit (HBHTP) algorithms for signal recovery. It turns out that the HBHT and HBHTP can successfully recover a k-sparse signal if the restricted isometry constant of the measurement matrix satisfies delta3k<0.618 and delta3k<0.577, respectively. The guaranteed success of HBHT and HBHTP is also shown under the conditions delta2k<0.356 and delta2k<0.377, respectively. Moreover, the finite convergence and stability of the two algorithms are also established in this paper. Simulations on random problem instances are performed to compare the performance of the proposed algorithms and several existing ones. Empirical results indicate that the HBHTP performs very comparably to a few existing algorithms and it takes less average time to achieve the signal recovery than these existing methods.


Full work available at URL: https://arxiv.org/abs/2204.09300





Cites Work


Cited In (6)


   Recommendations





This page was built for publication: Heavy-ball-based hard thresholding algorithms for sparse signal recovery

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