The Thresholding Greedy Algorithm, Greedy Bases, and Duality

177 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Nonlinear Approximation with Dictionaries I. Direct Estimates (2004, unknown): “, a weaker notion than best m-term approximation), see [11] for details.”
Greedy Approximation with Regard to Bases and General Minimal Systems (2002, background): “The proof is based on the following known lemma (see [6]) that is essentially due to Wojtaszczyk [32].”
Characterization of 1-almost greedy bases (2015, background): “ρ of x. Similarly, if (en)∞ n=1 is C-suppression quasi-greedy then for all x ∈ Xand m ∈ Nwe have kx− Gm(x)k ≤ Ckxk, (1.5) for any m-term greedy approximation Gm(x) to x. Dilworth et al. introduced in [4] a property for bases basis that is intermediate between quasi-greedy and greedy. They deﬁned a b”
Greedy approximation (2008, background): “The following proposition follows from the proof of Theorem 3.3 of Dilworth et al. (2003) (see Theorem 1.4.10 below).”
Unconditionality in spaces of m-homogeneous polynomials (2005, background): “We refer to [10, 11] for more information on greedy bases.”