Convergence of some greedy algorithms in Banach spaces

DOI10.1007/s00041-002-0023-4zbMath1025.41021OpenAlexW2040958526MaRDI QIDQ1865805

Denka Kutzarova, Stephen Dilworth, Vladimir N. Temlyakov

Publication date: 2 April 2003

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00041-002-0023-4

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Geometry and structure of normed linear spaces (46B20) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items

Constructive sparse trigonometric approximation for functions with small mixed smoothness ⋮ Lebesgue constants for Chebyshev thresholding greedy algorithms ⋮ Efficiency of weak greedy algorithms for \(m\)-term approximations ⋮ Nonlinear trigonometric approximations of multivariate function classes ⋮ Incremental Greedy Algorithm and Its Applications in Numerical Integration ⋮ On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces ⋮ Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces. ⋮ Sparse Approximation by Greedy Algorithms ⋮ On the convergence of greedy algorithms for initial segments of the Haar basis ⋮ The weak Chebyshev X-greedy algorithm in the unweighted Bergman space ⋮ Weak convergence of greedy algorithms in Banach spaces ⋮ Characterization of weight-semi-greedy bases ⋮ Greedy approximation for biorthogonal systems in quasi-Banach spaces ⋮ A unified way of analyzing some greedy algorithms ⋮ Strong solvability in Orlicz spaces ⋮ The weighted property (A) and the greedy algorithm