Convergence of orthogonal greedy algorithm with errors in projectors

DOI10.3103/S0027132213010075MaRDI QIDQ355338zbMATH OpenFDO

Authors N. N. Fedotov

Publication date 24 July 2013

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

Full work available at URL https://doi.org/10.3103/S0027132213010075

zbMATH Keywords

convergenceerror estimategreedy algorithmHilbert spaceiterative approximationprojectionstabilitysubspace

Mathematics Subject Classification ID

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

Review text

Iterative approximations of an element in a Hilbert space with elements in a subset called dictionary are discussed. The author proposes an orthogonal greedy algorithm and discusses computational errors and stability of the algorithm with respect to errors in projections onto the embedded subspaces. Convergence is established in terms of computational errors.

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

Cites work

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