Greedy-type approximation in Banach spaces and applications
From MaRDI portal
Publication:1772235
DOI10.1007/s00365-004-0565-6zbMath1070.41018OpenAlexW1972937048MaRDI QIDQ1772235
Publication date: 15 April 2005
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00365-004-0565-6
discrepancygreedy algorithmstrigonometric approximationuniformly smooth Banach spacesgreedy approximation
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, The Marcinkiewicz-type discretization theorems, Convex optimization on Banach spaces, Biorthogonal greedy algorithms in convex optimization, Nonlinear trigonometric approximations of multivariate function classes, Convergence and rate of convergence of some greedy algorithms in convex optimization, An extrapolation theorem for nonlinear approximation and its applications, Connections between numerical integration, discrepancy, dispersion, and universal discretization, The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers, Incremental Greedy Algorithm and Its Applications in Numerical Integration, On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces, Sparse Approximation by Greedy Algorithms, Greedy expansions in convex optimization, A unified way of analyzing some greedy algorithms, Greedy approximation in convex optimization
