On convergence of weak greedy algorithms
From MaRDI portal
This paper deals with the weak greedy algorithm (WGA) introduced by \textit{V. N. Temlyakov} [Adv. Comput. Math. 12, No. 2-3, 213-227 (2000; Zbl 0964.65009)]. It is a modification of a pure greedy algorithm (PGA). At the \(m\)-th step of the WGA an approximating element from a given dictionary is chosen using a weaker condition than the one in a PGA. It is demonsrated that the WGA converges for all elements of any separable Hilbert space and any dictionary.NEWLINENEWLINEFor the entire collection see [Zbl 0981.00017].
Recommendations
- A criterion for convergence of weak greedy algorithms
- Weak convergence of a greedy algorithm and the WN-property
- On the convergence of approximate weak gready algorithms
- Weak convergence of greedy algorithms in Banach spaces
- Approximate weak greedy algorithms
- On the rate of convergence of greedy algorithms.
- Generalized approximate weak greedy algorithms
- Lower bounds for the rate of convergence of greedy algorithms
- On the rate of convergence of a pure greedy algorithm.
- Convergence of greedy algorithms in Banach spaces
Cited in
(23)- Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces.
- A criterion for convergence of weak greedy algorithms
- Weak greedy algorithms
- The rate of convergence of weak greedy approximations over orthogonal dictionaries
- Simultaneous approximation by greedy algorithms
- Generalized approximate weak greedy algorithms
- Weak convergence of a greedy algorithm and the WN-property
- Efficiency of weak greedy algorithms for m-term approximations
- On the generalized approximate weak Chebyshev greedy algorithm
- On the convergence of approximate weak gready algorithms
- An X -greedy algorithm with weakness parameters
- scientific article; zbMATH DE number 2111760 (Why is no real title available?)
- Convergence of an algorithm for constructing snakes
- Efficiency of the weak Rescaled Pure Greedy Algorithm
- On the recursive greedy algorithm
- Simultaneous greedy approximation in Banach spaces
- Approximate weak greedy algorithms
- Matching pursuit with unbounded parameter domains
- Vector greedy algorithms
- Brief introduction in greedy approximation
- New conditions for the convergence of a weak greedy algorithm
- Weak convergence of greedy algorithms in Banach spaces
- On \(n\)-term approximation with positive coefficients
This page was built for publication: On convergence of weak greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2783079)
