Greedy algorithm with gaps
The aim of the present paper is to extend some results on greedy approximation algorithms to greedy algorithms allowing gaps in the approximating sequences. Let \(X\) be a Banach space and \((e_i,e^*_i)\in X\times X^*,\, i\in I,\) a biorthogonal system such that span\(\{e_i\}\) is dense in \(X\), span\(\{e^*_i\}\) is \(w^*\)-dense in \(X^*\) and \(\sup_i\max\{\|e_i\|,\|e^*_i\|\}<\infty\). For a finite subset \(A\) of \(I\) and \(x\in X\) put \(Ax=\sum_{i\in A}\langle e_i^*,x\rangle e_i\,.\) Let \( 0 < t\leq 1\). A set \(A\subset I\) is called \(t\)-greedy (greedy if \(t=1\)) for \(x\in X\) if \(\inf_{i\in A}|\langle e_i^*,x\rangle| \geq t\sup_{i\in I\setminus A}|\langle e_i^*,x\rangle|.\) A \(t\)-greedy projection of \(x\) is \(\mathbf{G}^t_m(x)=Ax\) where \(A\) is a \(t\)-greedy subset of \(I\) of cardinality \(m\). For a sequence \( \mathbf{n}=(n_1 < n_2 < \dots)\) of natural numbers one says that the system \((e_i)\) is \(\mathbf{n}\)-quasi-greedy with parameter \(t\) (\(\mathbf{n}\)-\(t\)-QG) if for every \(x\in X,\, \lim_k \mathbf{G}^t_{n_k}x=x\) for any choice of greedy projections \(\mathbf{G}^t_{n_k}\). If \(\mathbf{n}=\mathbb{N}\) one says that \((e_i)\) is \(t\)-quasi-greedy (quasi-greedy for \(t=1\)). The authors characterizes the \(\mathbf{n}\)-\(t\)-QG bases as those bases \(\{(e_i,e^*_i)\}\) for which there exists a constant \(C\geq 0\) such that for all \(x\in X\), \(\|\mathbf{G}^t_n(x)\|\leq C\|x\|\) for any \(n \in \mathbf{n}\) and any \(t\)-greedy projection \(\mathbf{G}^t_n\) (Theorem 2.1). He gives examples of \(\mathbf{n}\)-QG-bases which are not QG. He also shows that that any basis which is \(\mathbf{n}\)-QG with constant 1 must be 1-suppression unconditional (meaning that \(\|\sum_{i\in B}\alpha_i e_i\|\leq \|\sum_{i\in A}\alpha_i e_i\|,\) whenever \(B\subset A\) are finite subsets of \(\mathbb{N}\)), extending a result of \textit{F. Albiac} and \textit{J. L. Ansorena} [J. Approx. Theory 201, 7--12 (2016; Zbl 1335.46010)]. In Section 5, one shows that certain classical bases -- as the Haar basis in \(L_1\), the trigonometric basis in a weighted \(L_p\) space -- are not \(\mathbf{n}\)-QG, for any sequence \(\mathbf{n}\).
- Greedy in Approximation Algorithms
- Greedy algorithms with prescribed coefficients
- A greedy algorithm for interval greedoids
- A framework for the greedy algorithm
- scientific article; zbMATH DE number 2111760
- A note on greedy algorithm
- scientific article; zbMATH DE number 169611
- Some remarks on greedy algorithms
- The greedy algorithm as a combinatorial principle
- Greedy approximation
- Additive bases arising from functions in a Hardy field
- Additive combinatorics
- Characterization of 1-quasi-greedy bases
- Cofinite subsets of asymptotic bases for the positive integers
- Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness
- Greedy algorithm for general biorthogonal systems
- Greedy approximation
- Greedy approximation
- scientific article; zbMATH DE number 3784967 (Why is no real title available?)
- scientific article; zbMATH DE number 914352 (Why is no real title available?)
- scientific article; zbMATH DE number 3271087 (Why is no real title available?)
- Lebesgue constants for the weak greedy algorithm
- Lebesgue inequalities for the greedy algorithm in general bases
- On the existence of almost greedy bases in Banach spaces
- Quasi-greedy bases and Lebesgue-type inequalities
- Restricted Khinchine inequality
- Trigonometric quasi-greedy bases for L^p( T;w)
- Waring's Problem with Polynomial Summands
- Quasi-greedy bases for sequences with gaps
- Characterization of weight-semi-greedy bases
- Bidemocratic bases and their connections with other greedy-type bases
- Performance of the thresholding greedy algorithm with larger greedy sums
- Greedy approximation for biorthogonal systems in quasi-Banach spaces
- Extensions of democracy-like properties for sequences with gaps
- Greedy algorithm for general biorthogonal systems
- Greedy-like bases for sequences with gaps
- Greedy approximation algorithms for sparse collections
- Weak weight-semi-greedy Markushevich bases
- Greedy algorithms: a review and open problems
- Approximation by polynomials with constant coefficients and the thresholding greedy algorithm
- Strong partially greedy bases with respect to an arbitrary sequence
- Enlarge greedy sums in greedy-type properties by different factors
This page was built for publication: Greedy algorithm with gaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1685952)
