@article{4a73a0b31a5a4bd4a12a85edacbe1d8f,
title = "Weak thresholding greedy algorithms in Banach spaces",
abstract = "We consider weak thresholding greedy algorithms with respect to Markushevich bases in general Banach spaces. We find sufficient conditions for the equivalence of boundedness and convergence of the approximants. We also show that if there is a weak thresholding 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 {"}almost greedy{"} and {"}semi-greedy{"} systems.",
keywords = "Banach spaces, Greedy approximation, Thresholding greedy algorithm, Weak thresholding",
author = "Dilworth, {S. J.} and Denka Kutzarova and Th Schlumprecht and P. Wojtaszczyk",
note = "Funding Information: ✩ The first author was partially supported by NSF grants DMS 0701552 and DMS 1101490, the third author was supported by NSF grant DMS 0856148, and the fourth author was supported by Polish MNiSW grant N201 269335 and EU project POWIEW. All authors were supported by the Workshop in Analysis and Probability at Texas A&M University in 2011. * Corresponding author. E-mail addresses: dilworth@math.sc.edu (S.J. Dilworth), denka@math.uiuc.edu (D. Kutzarova), thomas.schlumprecht@math.tamu.edu (Th. Schlumprecht), wojtaszczyk@mimuw.edu.pl (P. Wojtaszczyk). 1 Current address: Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA. 2 Current address: Interdisciplinary Centre for Mathematical and Computational Modelling, University of Warsaw, ul. Prosta 69, 02-838 Warszawa, Poland.",
year = "2012",
month = dec,
day = "15",
doi = "10.1016/j.jfa.2012.09.011",
language = "English (US)",
volume = "263",
pages = "3900--3921",
journal = "Journal of Functional Analysis",
issn = "0022-1236",
publisher = "Academic Press Inc.",
number = "12",
}