Relaxation in greedy approximation

DOI10.1007/s00365-006-0652-5zbMath1167.41006OpenAlexW2027161466MaRDI QIDQ944229

Vladimir N. Temlyakov

Publication date: 12 September 2008

Published in: Constructive Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00365-006-0652-5

zbMATH Keywords

algorithmsconvergencerate of convergenceapproximation methodsBanach spacegreedy algorithmsforms of relaxation

Mathematics Subject Classification ID

Geometry and structure of normed linear spaces (46B20) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Rate of convergence, degree of approximation (41A25)

Related Items (9)

Greedy approximation of characteristic functions ⋮ Sparse approximation of individual functions ⋮ On \(n\)-term approximation with positive coefficients ⋮ On the convergence of greedy algorithms for initial segments of the Haar basis ⋮ Schwarz iterative methods: infinite space splittings ⋮ Approximation by neural networks and learning theory ⋮ Weak convergence of greedy algorithms in Banach spaces ⋮ A unified way of analyzing some greedy algorithms ⋮ Greedy approximation in convex optimization

This page was built for publication: Relaxation in greedy approximation