Iterative projection gradient hard thresholding pursuit algorithm for sparse optimization

DOI10.15960/J.CNKI.ISSN.1007-6093.2019.01.001MaRDI QIDQ5234773zbMATH OpenFDO

Authors Xinbei Chen, Mingkang Zhu, Jianli Chen

Publication date 2 October 2019

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2019.01.001

zbMATH Keywords

gradient hard thresholding pursuit algorithminteger programiterative projectionsparsity constraint

Mathematics Subject Classification ID

Integer programming (90C10) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Gradient projection Newton pursuit for sparsity constrained optimization
• scientific article; zbMATH DE number 6982922
• Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
• A convergent iterative hard thresholding for nonnegative sparsity optimization
• A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery

Cited in

(8)

• An adaptive gradient projection algorithm for piecewise convex optimization and its application in compressed spectrum sensing
• Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
• Weighted thresholding homotopy method for sparsity constrained optimization
• Gradient projection Newton pursuit for sparsity constrained optimization
• A convergent iterative hard thresholding for nonnegative sparsity optimization
• scientific article; zbMATH DE number 6982922 (Why is no real title available?)
• Scaled proximal gradient methods for sparse optimization problems
• Constrained mix sparse optimization via hard thresholding pursuit

This page was built for publication: Iterative projection gradient hard thresholding pursuit algorithm for sparse optimization

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