The convergence guarantee of the iterative hard thresholding algorithm with suboptimal feedbacks for large systems

DOI10.1016/J.AML.2019.06.001MaRDI QIDQ2275173zbMATH OpenOpenAlexWikidataFDO

Authors Ningning Han, Shidong Li, Zhan-Jie Song

Publication date 2 October 2019

Published in Applied Mathematics Letters (Search for Journal in Brave)

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

zbMATH Keywords

feedbacklarge-scale datanull space tuningsparse signalthresholding

Mathematics Subject Classification ID

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

Abstract: Thresholding based iterative algorithms have the trade-off between effectiveness and optimality. Some are effective but involving sub-matrix inversions in every step of iterations. For systems of large sizes, such algorithms can be computationally expensive and/or prohibitive. The null space tuning algorithm with hard thresholding and feedbacks (NST+HT+FB) has a mean to expedite its procedure by a suboptimal feedback, in which sub-matrix inversion is replaced by an eigenvalue-based approximation. The resulting suboptimal feedback scheme becomes exceedingly effective for large system recovery problems. An adaptive algorithm based on thresholding, suboptimal feedback and null space tuning (AdptNST+HT+subOptFB) without a prior knowledge of the sparsity level is also proposed and analyzed. Convergence analysis is the focus of this article. Numerical simulations are also carried out to demonstrate the superior efficiency of the algorithm compared with state-of-the-art iterative thresholding algorithms at the same level of recovery accuracy, particularly for large systems.

Recommendations

• Fast thresholding algorithms with feedbacks for sparse signal recovery
• The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
• Between hard and soft thresholding: optimal iterative thresholding algorithms
• Hard thresholding pursuit: an algorithm for compressive sensing
• Convergence analysis of compressive sensing based on SCAD iterative thresholding algorithm

Cites work

• Convergence analysis of the augmented Lagrange multiplier algorithm for a class of matrix compressive recovery
• Critical variable exponent functionals in image restoration
• Decoding by Linear Programming
• Fast thresholding algorithms with feedbacks for sparse signal recovery
• Hard thresholding pursuit algorithms: number of iterations
• Hard thresholding pursuit: an algorithm for compressive sensing
• scientific article; zbMATH DE number 3062467 (Why is no real title available?)
• Iterative Algorithms Based on Decoupling of Deblurring and Denoising for Image Restoration
• Iterative hard thresholding for compressed sensing
• Iterative thresholding for sparse approximations
• Low rank tensor recovery via iterative hard thresholding
• Spectral compressive sensing

Cited in

(3)

• The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing
• Convergence of Iterative Water-Filling With Quantized Feedback: A Sufficient Condition
• Convergence of iterative hard-thresholding algorithm with continuation

This page was built for publication: The convergence guarantee of the iterative hard thresholding algorithm with suboptimal feedbacks for large systems

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