๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Simultaneous approximation by greedy algorithms

โœ Scribed by D. Leviatan; V. N. Temlyakov

Publisher
Springer
Year
2006
Tongue
English
Weight
281 KB
Volume
25
Category
Article
ISSN
1019-7168

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Improving Greedy Algorithms by Lookahead
Improving Greedy Algorithms by Lookahead-Search
โœ U.K. Sarkar; P.P. Chakrabarti; S. Ghose; S.C. Desarkar ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 967 KB

This paper shows that repeated application of a greedy approximation algorithm on some suitably selected subproblems of a problem often leads to a solution which is better than the solution produced by the greedy algorithm applied to the original problem. The lookahead search technique, a polynomial

Greedy Algorithms andM-Term Approximatio
Greedy Algorithms andM-Term Approximation with Regard to Redundant Dictionaries
โœ V.N. Temlyakov ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 198 KB

We study the efficiency of greedy type algorithms with regard to redundant dictionaries in Hilbert space and we prove a general result which gives a sufficient condition on a dictionary to guarantee that the pure greedy algorithm is near best in the sense of power decay of error of approximation. We