Nonlinear approximation in finite-dimensional spaces
From MaRDI portal
Publication:1383443
DOI10.1006/jcom.1997.0458zbMath0892.41009OpenAlexW2159059600MaRDI QIDQ1383443
Vladimir N. Temlyakov, Ronald A. DeVore
Publication date: 20 July 1998
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b0a3e5014091b2ff3d946a1ad8fe35ca13d1a0ed
Related Items
Approximation by pseudo-linear operators, The best \(M\)-term trigonometric approximations of the classes of periodic multivariate functions with bounded generalized derivative in the space \(L_q\), Vector greedy algorithms, Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems, Complexity of neural network approximation with limited information: A worst case approach, Simultaneous approximation by greedy algorithms, Adaptive martingale approximations, Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
Cites Work
- Unnamed Item
- Unnamed Item
- Entropy numbers of diagonal operators between symmetric Banach spaces
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Rates of convex approximation in non-Hilbert spaces
- Nonlinear approximation by trigonometric sums
- On best \(m\)-term approximations and the entropy of sets in the space \(L^ 1\)
- Some remarks on greedy algorithms
- Universal approximation bounds for superpositions of a sigmoidal function
- Adaptive greedy approximations
