A criterion for convergence of weak greedy algorithms
type: Item
instance of: scholarly article
title: A criterion for convergence of weak greedy algorithms
zbMATH Open document ID: 1128.41309
DOI: 10.1023/A:1016061804993
published in: Advances in Computational Mathematics
publication date: 2002-08-19T00:00:00Z
review text: This paper completes the investigation of necessary and sufficient conditions on the weakness sequence \(\tau = \{t_k\}_{k=1}^{\infty}\), \(0\leq t_k\leq 1\) for convergence of weak greedy algorithm for all dictionaries \(\mathcal D\) and each function \(f\) in the Hilbert space \(H\).
reviewed by: Karel Najzar
Mathematics Subject Classification ID: 41A65
Mathematics Subject Classification ID: 41A25
Mathematics Subject Classification ID: 41A05
zbMATH DE Number: 1783433
zbMATH Keywords: weak Greedy Algorithms
zbMATH Keywords: Hilbert space
zbMATH Keywords: dictionary, convergence
author: V. N. Temlyakov
MaRDI profile type: Publication
full work available at URL: a:1016061804993
OpenAlex ID: W20244218
Recommended article: On convergence of weak greedy algorithms
Recommended article: Weak convergence of a greedy algorithm and the WN-property
Recommended article: Weak convergence of greedy algorithms in Banach spaces
Recommended article: Q3433583
Recommended article: Approximate weak greedy algorithms
Recommended article: Lebesgue constants for the weak greedy algorithm
Recommended article: Lower bounds for the rate of convergence of greedy algorithms
Recommended article: Generalized approximate weak greedy algorithms
Recommended article: On the rate of convergence of a pure greedy algorithm.
Recommended article: On the rate of convergence of greedy algorithms.
description: scientific article; zbMATH DE number 1783433