Relaxation quadratic approximation greedy pursuit method based on sparse learning

DOI10.1515/cmam-2023-0050MaRDI QIDQ6651176

Shihai Li, Chang-Feng Ma

Publication date: 10 December 2024

Published in: Computational Methods in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Newton-type methodsparse learningquadratic approximate

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Iterative hard thresholding for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• On Lower and Upper Bounds for Smooth and Strongly Convex Optimization Problems
• Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
• A Tight Bound of Hard Thresholding
• Sparse Approximate Solutions to Linear Systems
• Greedy Sparsity-Constrained Optimization
• Compressed sensing

This page was built for publication: Relaxation quadratic approximation greedy pursuit method based on sparse learning