Weak thresholding greedy algorithms in Banach spaces
The paper is motivated by \textit{S. Gogyan}'s weak thresholding version of the thresholding greedy algorithm in \(L^1 (0,1)\) with regard to the Haar system [J. Approx. Theory 161, No. 1, 49--64 (2009; Zbl 1177.41032)]. The authors extract the basic features of Gogyan's weak thresholding greedy algorithm into a new definition of branch greedy algorithms with respect to Markushevich bases in general Banach spaces. The relationship between convergence of the algorithm and uniform boundedness of the approximants is studied: these two properties are not the same in general, but are equivalent for a natural subclass of branch greedy algorithms. It is shown that, if there is a branch greedy algorithm for the system which gives the best \(n\)-term approximation up to a multiplicative constant, then the system is already greedy. Similar results are proved for branch almost greedy systems in arbitrary spaces and for branch semi-greedy Schauder bases in spaces of finite cotype.
- Characterization of 1-greedy bases
- Greedy algorithm and \(m\)-term trigonometric approximation
- Greedy algorithm for general biorthogonal systems
- Greedy approximation
- Greedy approximations with regard to bases
- scientific article; zbMATH DE number 1959425 (Why is no real title available?)
- scientific article; zbMATH DE number 2016952 (Why is no real title available?)
- scientific article; zbMATH DE number 5662770 (Why is no real title available?)
- On approximate _1 systems in Banach spaces
- On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1)
- On the existence of almost greedy bases in Banach spaces
- Séries de variables aléatoires vectorielles indépendantes et propriétés géométriques des espaces de Banach
- The best m-term approximation and greedy algorithms
- The entropy in learning theory. Error estimates
- The thresholding greedy algorithm, greedy bases, and duality
- On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1)
- The thresholding greedy algorithm, greedy bases, and duality
- Quasi-greedy bases for sequences with gaps
- On some characterizations of greedy-type bases
- The weighted property (A) and the greedy algorithm
- Lebesgue constants for the weak greedy algorithm
- The weak Chebyshev X-greedy algorithm in the unweighted Bergman space
- Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
- Efficiency of weak greedy algorithms for m-term approximations
- On the existence of almost greedy bases in Banach spaces
- On the convergence of a weak greedy algorithm for the multivariate Haar basis
- Greedy approximation for biorthogonal systems in quasi-Banach spaces
- Weak forms of unconditionality of bases in greedy approximation
- Greedy algorithms with restricted depth search
- Extensions of democracy-like properties for sequences with gaps
- Greedy-like bases for sequences with gaps
- The thresholding greedy algorithm versus approximations with sizes bounded by certain functions f
- Weak weight-semi-greedy Markushevich bases
- Weak convergence of greedy algorithms in Banach spaces
- Lebesgue constants for Chebyshev thresholding greedy algorithms
This page was built for publication: Weak thresholding greedy algorithms in Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932180)
