Convergence of orthogonal greedy algorithm with errors in projectors

DOI10.3103/S0027132213010075zbMATH Open1279.65056MaRDI QIDQ355338FDOQ355338

Authors: N. N. Fedotov 

Publication date: 24 July 2013

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Recommendations

• Projection greedy algorithm
• The rate of convergence of weak greedy approximations over orthogonal dictionaries
• On the rate of convergence of greedy algorithms.
• Conical greedy algorithm
• Weak greedy algorithms

zbMATH Keywords

convergencestabilityprojectionHilbert spacegreedy algorithmsubspaceerror estimateiterative approximation

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Iterative procedures involving nonlinear operators (47J25)

Cites Work

• Universal approximation bounds for superpositions of a sigmoidal function
• Matching pursuits with time-frequency dictionaries
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• Some remarks on greedy algorithms
• Weak greedy algorithms
• Approximate weak greedy algorithms
• Asymptotics of the module of a degenerating condenser and some of their applications
• Generalized approximate weak greedy algorithms

Cited In (1)

• Vector greedy algorithms

This page was built for publication: Convergence of orthogonal greedy algorithm with errors in projectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q355338)