On greedy approximation in complex Banach spaces
From MaRDI portal
Cites work
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- A unified way of analyzing some greedy algorithms
- Adaptive greedy approximations
- Approximation and learning by greedy algorithms
- Biorthogonal greedy algorithms in convex optimization
- Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces.
- Convex optimization on Banach spaces
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Greedy algorithms in Banach spaces
- Greedy approximation
- Greedy-type approximation in Banach spaces and applications
- Lebesgue-type inequalities in greedy approximation
- Multivariate approximation
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- Projection pursuit
- Rates of convex approximation in non-Hilbert spaces
- Rescaled pure greedy algorithm for convex optimization
- Sequential greedy approximation for certain convex optimization problems
- Some remarks on greedy algorithms
- Trading accuracy for sparsity in optimization problems with sparsity constraints
- Universal approximation bounds for superpositions of a sigmoidal function
This page was built for publication: On greedy approximation in complex Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6980276)
