On the convergence of greedy algorithms for initial segments of the Haar basis

DOI10.1017/S0305004109990478zbMath1190.41010arXiv0905.3036OpenAlexW3100987231MaRDI QIDQ3559982

Thomas Schlumprecht, András Zsák, Stephen Dilworth, Edward Odell

Publication date: 17 May 2010

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.3036

zbMATH Keywords

periodic functionKolmogorov width\(L_1\) approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50)

Related Items (2)

Counterexamples in isometric theory of symmetric and greedy bases ⋮ Renormings and symmetry properties of 1-greedy bases

Cites Work

• Weak convergence of greedy algorithms in Banach spaces
• Relaxation in greedy approximation
• Projection pursuit
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• Nonlinear methods of approximation
• Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces.
• Convergence of some greedy algorithms in Banach spaces
• Convergence of greedy algorithms in Banach spaces
• Weak greedy algorithms
• Greedy algorithms in Banach spaces

This page was built for publication: On the convergence of greedy algorithms for initial segments of the Haar basis