Lower estimations of pure greedy algorithm with shrinkage

DOI10.1186/S13660-026-03431-WMaRDI QIDQ7410597zbMATH OpenFDO

Authors Fangjing Zhu, Yi Shen, Qifeng Zhang

Publication date 2026

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1186/S13660-026-03431-W

zbMATH Keywords

decay rategreedy algorithmslower estimateshrinkagesuboptimal

Mathematics Subject Classification ID

Approximations and expansions (41Axx) Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Communication, information (94Axx)

Cites work

• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Adaptive greedy approximations
• Approximate weak greedy algorithms
• Greedy algorithms: a review and open problems
• Greedy approximation
• Greedy expansions in Banach spaces
• Greedy expansions in Hilbert spaces
• scientific article; zbMATH DE number 1215245 (Why is no real title available?)
• Lower bounds for the rate of convergence of greedy algorithms
• Matching pursuits with time-frequency dictionaries
• Nonlinear methods of approximation
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• On the rate of convergence of a pure greedy algorithm.
• On the rate of convergence of greedy algorithms.
• Optimal Convergence Rates for the Orthogonal Greedy Algorithm
• Rate of convergence of pure greedy algorithm.
• Rescaled pure greedy algorithm for convex optimization
• Sharp convergence rates for matching pursuit
• Some remarks on greedy algorithms
• Two lower estimates in greedy approximation
• Weak greedy algorithms

This page was built for publication: Lower estimations of pure greedy algorithm with shrinkage

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