Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
From MaRDI portal
Publication:2079693
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 performs thresholding and objective function minimization simultaneously. This motivates us to propose the so-called partial gradient optimal thresholding method in this paper, which is an integration of the partial gradient and the optimal -thresholding technique. The solution error bound and convergence for the proposed algorithms have been established in this paper under suitable conditions. Application of our results to the sparse optimization problems arising from signal recovery is also discussed. Experiment results from synthetic data indicate that the proposed algorithm called PGROTP is efficient and comparable to several existing algorithms.
Recommendations
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Iterative projection gradient hard thresholding pursuit algorithm for sparse optimization
- Gradient projection Newton pursuit for sparsity constrained optimization
- Between hard and soft thresholding: optimal iterative thresholding algorithms
Cites work
- A mathematical introduction to compressive sensing
- A new computational method for the sparsest solutions to systems of linear equations
- Atomic decomposition by basis pursuit
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Compressed sensing and its applications. Selected papers of the third international MATHEON conference, TU Berlin, Berlin, Germany, December 4--8, 2017
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- De-noising by soft-thresholding
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Global and quadratic convergence of Newton hard-thresholding pursuit
- Hard thresholding pursuit algorithms: number of iterations
- Hard thresholding pursuit: an algorithm for compressive sensing
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Iterative thresholding algorithms
- Iterative thresholding for sparse approximations
- Newton method for \(\ell_0\)-regularized optimization
- Newton-Step-Based Hard Thresholding Algorithms for Sparse Signal Recovery
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- Performance comparisons of greedy algorithms in compressed sensing.
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse optimization theory and methods
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
Cited in
(16)- Weighted thresholding homotopy method for sparsity constrained optimization
- Gradient projection Newton pursuit for sparsity constrained optimization
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Generalized Thresholding and Online Sparsity-Aware Learning in a Union of Subspaces
- Between hard and soft thresholding: optimal iterative thresholding algorithms
- Thresholding gradient methods in Hilbert spaces: support identification and linear convergence
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Iterative projection gradient hard thresholding pursuit algorithm for sparse optimization
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- Heavy-ball-based hard thresholding algorithms for sparse signal recovery
- Scaled proximal gradient methods for sparse optimization problems
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing
- Dynamic thresholding algorithm with memory for linear inverse problems
- Limited memory bundle DC algorithm for sparse pairwise kernel learning
- Adaptive projected gradient thresholding methods for constrained \(l_0\) problems
This page was built for publication: Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079693)
