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

DOI10.1017/S0305004109990478zbMATH Open1190.41010arXiv0905.3036OpenAlexW3100987231MaRDI QIDQ3559982FDOQ3559982

Authors: Th. Schlumprecht, A. Zsák, S. J. Dilworth, E. Odell 

Publication date: 17 May 2010

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

Abstract: We consider the $X$-Greedy Algorithm and the Dual Greedy Algorithm in a finite-dimensional Banach space with a strictly monotone basis as the dictionary. We show that when the dictionary is an initial segment of the Haar basis in $L_p[0,1]$ ($1<p<infty$) then the algorithms terminate after finitely many iterations and that the number of iterations is bounded by a function of the length of the initial segment. We also prove a more general result for a class of strictly monotone bases.

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

Recommendations

• On the convergence of a weak greedy algorithm for the multivariate Haar basis
• Greedy algorithm with regard to Haar subsystems
• The convergence of the greedy algorithm with respect to the Haar system in the space \(L_{p}\)(0,1)
• Convergence of some greedy algorithms in Banach spaces
• On a greedy algorithm in the space \(L_p[0,1]\)

zbMATH Keywords

periodic functionKolmogorov width\(L_1\) approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50)

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Counterexamples in isometric theory of symmetric and greedy bases
• On a greedy algorithm in the space \(L_p[0,1]\)
• Renormings and symmetry properties of 1-greedy bases
• On the convergence of a weak greedy algorithm for the multivariate Haar basis

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

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