Approximation on anisotropic Besov classes with mixed norms by standard information

DOI10.1016/j.jco.2004.09.004zbMath1078.41027MaRDI QIDQ558005

Gen Sun Fang, Fred J. Hickernell, Hu-An Li

Publication date: 30 June 2005

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2004.09.004

zbMATH Keywords

Interpolation; Information-based complexity; Exact order; Optimal recovery

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

30E10: Approximation in the complex plane

41A65: Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)

41A46: Approximation by arbitrary nonlinear expressions; widths and entropy

Related Items

Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms, Approximation of anisotropic classes by standard information

Cites Work

• Unnamed Item
• Unnamed Item
• Vector greedy algorithms
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Martingales with values in uniformly convex spaces
• Rates of convex approximation in non-Hilbert spaces
• Nonlinear methods of approximation
• Some remarks on greedy algorithms
• Weak greedy algorithms
• Simultaneous approximation by greedy algorithms
• Universal approximation bounds for superpositions of a sigmoidal function
• Greedy algorithms in Banach spaces