A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
From MaRDI portal
Publication:827377
DOI10.1007/s40314-020-01313-5zbMath1463.65159OpenAlexW3085880247MaRDI QIDQ827377
Jinyao Ma, Benxin Zhang, Zhi Bin Zhu
Publication date: 7 January 2021
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-020-01313-5
Related Items (2)
Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing ⋮ Two classes of spectral conjugate gradient methods for unconstrained optimizations
Cites Work
- A note on the complexity of proximal iterative hard thresholding algorithm
- A full-Newton step interior-point algorithm based on modified Newton direction
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- A note about WYL's conjugate gradient method and its applications
- Hybrid conjugate gradient algorithm for unconstrained optimization
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Book Review: A mathematical introduction to compressive sensing
- Market equilibrium via a primal--dual algorithm for a convex program
- Compressed Sensing and Redundant Dictionaries
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- A Tight Bound of Hard Thresholding
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- An adaptive inverse scale space method for compressed sensing
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
- Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization
- Finding all solutions of piecewise-linear resistive circuits using the simplex method
- An efficient hybrid conjugate gradient method for unconstrained optimization
This page was built for publication: A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
