Characterization of 1-greedy bases
From MaRDI portal
The authors investigate 1-greedy bases for a real Banach space, i.e., bases for which the greedy algorithm provides the best \(m\)-term approximation. A characterization of 1-greediness is studied. The authors also give a list of open problems that arise from this article.
Recommendations
Cites work
- A remark on greedy approximation in Banach spaces.
- An Introduction to Banach Space Theory
- Greedy algorithm for general biorthogonal systems
- scientific article; zbMATH DE number 44588 (Why is no real title available?)
- scientific article; zbMATH DE number 3471053 (Why is no real title available?)
- On subsequences of the Haar system in \(L_p [0,1]\), \((1<p<\infty)\)
- Symmetric bases of locally convex spaces
- The best m-term approximation and greedy algorithms
- The thresholding greedy algorithm, greedy bases, and duality
- Uniqueness of unconditional bases in quasi-Banach spaces with applications to Hardy spaces
Cited in
(42)- On perfectly homogeneous bases in quasi-Banach spaces
- Lebesgue inequalities for the greedy algorithm in general bases
- 1-greedy renormings of Garling sequence spaces
- Weak thresholding greedy algorithms in Banach spaces
- The functional-analytic properties of the limit \(q\)-Bernstein operator
- Quasi-greedy bases for sequences with gaps
- Strong partially greedy bases and Lebesgue-type inequalities
- Variations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithms
- Asymptotic greediness of the Haar system in the spaces \(L_p[0,1]\), \(1<p<\infty \)
- Weight-partially greedy bases and weight-property \((A)\)
- The weighted property (A) and the greedy algorithm
- Greedy bases in \(L^p\) spaces
- Performance of the thresholding greedy algorithm with larger greedy sums
- A remark on greedy approximation in Banach spaces.
- Conditional quasi-greedy bases in Hilbert and Banach spaces
- A note on partially-greedy bases in quasi-Banach spaces
- An example of an almost greedy basis in \(L^1(0,1)\)
- Renorming spaces with greedy bases
- Greedy approximation for biorthogonal systems in quasi-Banach spaces
- New parameters and Lebesgue-type estimates in greedy approximation
- Characterization of greedy bases in Banach spaces
- Characterization of 1-almost greedy bases
- Greedy algorithms and bases from the point of view of Banach space theory
- Extensions of democracy-like properties for sequences with gaps
- On weighted greedy-type bases
- Elton's near unconditionality of bases as a threshold-free form of greediness
- Counterexamples in isometric theory of symmetric and greedy bases
- Non-linear approximation by $1$-greedy bases
- Schreier families and \(\mathcal{F}\)-(almost) greedy bases
- On consecutive greedy and other greedy-like type of bases
- A note on 1-semi-greedy bases in \(p\)-Banach spaces with \(0 < P \leq 1\)
- The best m-term approximation with respect to polynomials with constant coefficients
- Weak weight-semi-greedy Markushevich bases
- Greedy algorithms: a review and open problems
- Twenty-five years of greedy bases
- Strong partially greedy bases with respect to an arbitrary sequence
- Greedy bases for Besov spaces
- Renormings and symmetry properties of 1-greedy bases
- Enlarge greedy sums in greedy-type properties by different factors
- On greedy types frame systems
- Conditional bases with Property (A)
- Characterization of 1-quasi-greedy bases
This page was built for publication: Characterization of 1-greedy bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818457)
