Weak thresholding greedy algorithms in Banach spaces
DOI10.1016/j.jfa.2012.09.011zbMath1267.46026OpenAlexW2027199502MaRDI QIDQ1932180
Denka Kutzarova, Thomas Schlumprecht, Stephen Dilworth, Przemysław Wojtaszczyk
Publication date: 17 January 2013
Published in: Journal of Functional Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfa.2012.09.011
Banach spacesthresholding greedy algorithmweak thresholdinggreedy approximationbranch greedy algorithm
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of 1-greedy bases
- The entropy in learning theory. Error estimates
- On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1)
- The best \(m\)-term approximation and greedy algorithms
- Greedy algorithm and \(m\)-term trigonometric approximation
- The thresholding greedy algorithm, greedy bases, and duality
- On approximate \(\ell_1\) systems in Banach spaces
- Greedy approximation
- Séries de variables aléatoires vectorielles indépendantes et propriétés géométriques des espaces de Banach
- On the existence of almost greedy bases in Banach spaces
- Greedy algorithm for general biorthogonal systems
This page was built for publication: Weak thresholding greedy algorithms in Banach spaces