@article{7db617d153f44c12b852f96fd40eba76,
title = "The weighted property (A) and the greedy algorithm",
abstract = "We investigate the efficiency of the Thresholding Greedy Algorithm, by comparing it to optimal “weighted” approximations. For a weight w, we describe w-greedy, w-almost-greedy, and w-partially-greedy bases, and examine some properties of w-semi-greedy bases. To achieve these goals, we introduce and study the w-Property (A).",
keywords = "Property (A), Thresholding greedy algorithm, Unconditional basis, w-greedy bases",
author = "Bern{\'a}, {P. M.} and Dilworth, {S. J.} and D. Kutzarova and T. Oikhberg and B. Wallis",
note = "Funding Information: The first author was supported by a PhD fellowship FPI-UAM, Spain and the grants MTM-2016-76566-P (MINECO, Spain) and 19368/PI/14 (fundaci?n S?neca, Regi?n de murcia, Spain). The second author was supported by the National Science Foundation, USA under grant number DMS?1361461. The second and third authors were supported by the Workshop in Analysis and Probability at Texas A&M University, USA in 2017. The third author was supported by Simons Foundation Collaborative Grant No 636954. Publisher Copyright: {\textcopyright} 2019 Elsevier Inc.",
year = "2019",
month = dec,
doi = "10.1016/j.jat.2019.105300",
language = "English (US)",
volume = "248",
journal = "Journal of Approximation Theory",
issn = "0021-9045",
publisher = "Academic Press Inc.",
}