Greedy algorithms in Banach spaces
From MaRDI portal
Publication:5950883
DOI10.1023/A:1016657209416zbMath0988.41022MaRDI QIDQ5950883
Publication date: 18 December 2001
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by other special function classes (41A30) Applications of functional analysis in numerical analysis (46N40)
Related Items
The Marcinkiewicz-type discretization theorems, Lebesgue-type inequalities in greedy approximation, Efficiency of weak greedy algorithms for \(m\)-term approximations, Greedy expansions in Banach spaces, Greedy approximation of characteristic functions, An inequality for the entropy numbers and its application, Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms, Unified error estimate for weak biorthogonal Greedy algorithms, Nonlinear tensor product approximation of functions, Incremental Greedy Algorithm and Its Applications in Numerical Integration, Cubature formulas, discrepancy, and nonlinear approximation, On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces, Sparse Approximation by Greedy Algorithms, Sparse approximation of individual functions, On the convergence of greedy algorithms for initial segments of the Haar basis, Dictionary descent in optimization, The weak Chebyshev X-greedy algorithm in the unweighted Bergman space, Simultaneous greedy approximation in Banach spaces, Approximation on anisotropic Besov classes with mixed norms by standard information, Weak convergence of greedy algorithms in Banach spaces, A unified way of analyzing some greedy algorithms, Strong solvability in Orlicz spaces, Efficiency of the weak Rescaled Pure Greedy Algorithm, On universal estimators in learning theory, Greedy approximation in convex optimization, SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
