Relaxation quadratic approximation greedy pursuit method based on sparse learning

DOI10.1515/CMAM-2023-0050MaRDI QIDQ6651176zbMATH OpenFDO

Authors Shihai Li, Changfeng Ma

Publication date 10 December 2024

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

Full work available at URL https://doi.org/10.1515/CMAM-2023-0050

zbMATH Keywords

Newton-type methodquadratic approximatesparse learning

Mathematics Subject Classification ID

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

Recommendations

• Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
• Greedy sparsity-constrained optimization
• An inexact projected gradient method for sparsity-constrained quadratic measurements regression
• Subspace quadratic regularization method for group sparse multinomial logistic regression
• scientific article; zbMATH DE number 6982922

Cites work

• A tight bound of hard thresholding
• Compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Greedy sparsity-constrained optimization
• Hard thresholding pursuit: an algorithm for compressive sensing
• scientific article; zbMATH DE number 6982922 (Why is no real title available?)
• Iterative hard thresholding for compressed sensing
• On lower and upper bounds in smooth and strongly convex optimization
• Pattern recognition and machine learning.
• Sparse Approximate Solutions to Linear Systems

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

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