Partial Gradient Optimal Thresholding Algorithms for a Class of Sparse Optimization Problems
Nan Meng, Yun-Bin Zhao, Michal Kocvara

TL;DR
This paper introduces the partial gradient optimal thresholding algorithm for sparse optimization, improving information retention during thresholding and demonstrating efficiency and convergence in signal recovery tasks.
Contribution
It proposes a novel partial gradient optimal thresholding method combining partial gradient and $k$-thresholding, with proven convergence and error bounds.
Findings
Algorithm PGROTP is efficient on synthetic data.
Proposed method is comparable to existing algorithms.
Theoretical convergence and error bounds are established.
Abstract
The optimization problems with a sparsity constraint is a class of important global optimization problems. A typical type of thresholding algorithms for solving such a problem adopts the traditional full steepest descent direction or Newton-like direction as a search direction to generate an iterate on which a certain thresholding is performed. Traditional hard thresholding discards a large part of a vector when the vector is dense. Thus a large part of important information contained in a dense vector has been lost in such a thresholding process. Recent study [Zhao, SIAM J Optim, 30(1), pp. 31-55, 2020] shows that the hard thresholding should be applied to a compressible vector instead of a dense vector to avoid a big loss of information. On the other hand, the optimal -thresholding as a novel thresholding technique may overcome the intrinsic drawback of hard thresholding, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Photoacoustic and Ultrasonic Imaging · Infrared Target Detection Methodologies
