The rate of convergence of weak greedy approximations over orthogonal dictionaries

DOI10.3103/S0027132217020097zbMath1372.65046MaRDI QIDQ2399411

Anastasia S. Orlova

Publication date: 23 August 2017

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

rate of convergenceHilbert spacegreedy algorithmnonlinear approximationorthogonal dictionaryweak greedy approximation

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items (1)

Convergence of a weak greedy algorithm when one vector is added to the orthogonal dictionary

Cites Work

• Unnamed Item
• Unnamed Item
• On the rate of convergence of greedy algorithms.
• Some remarks on greedy algorithms
• Weak greedy algorithms
• Lower bounds for the rate of convergence of greedy algorithms

This page was built for publication: The rate of convergence of weak greedy approximations over orthogonal dictionaries