Convergence of orthogonal greedy algorithm with errors in projectors
From MaRDI portal
Publication:355338
DOI10.3103/S0027132213010075zbMath1279.65056MaRDI QIDQ355338
Publication date: 24 July 2013
Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)
stabilitysubspaceconvergenceHilbert spacegreedy algorithmprojectionerror estimateiterative approximation
General theory of numerical analysis in abstract spaces (65J05) Iterative procedures involving nonlinear operators (47J25)
Cites Work
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- Asymptotics of the module of a degenerating condenser and some of their applications
- Some remarks on greedy algorithms
- Weak greedy algorithms
- Generalized approximate weak greedy algorithms
- Universal approximation bounds for superpositions of a sigmoidal function
- Matching pursuits with time-frequency dictionaries
- Approximate weak greedy algorithms
This page was built for publication: Convergence of orthogonal greedy algorithm with errors in projectors