The general problem addressed in this work is the development of a systematic study of the
thresholding greedy algorithm for general biorthogonal systems (also known as …

In nonlinear greedy approximation theory, bidemocratic bases have traditionally played the
role of dualizing democratic, greedy, quasi-greedy, or almost greedy bases. In this article we …

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 …

We obtain Lebesgue-type inequalities for the greedy algorithm for arbitrary complete
seminormalized biorthogonal systems in Banach spaces. The bounds are given only in …

Elton's near unconditionality and quasi-greediness for largest coefficients are two properties
of bases that made their appearance in functional analysis from very different areas of …

In this paper we study a new class of bases, weaker than quasi-greedy bases, which retain
their unconditionality properties and can provide the same optimality for the thresholding …

In this paper, we continue the study of Lebesgue-type inequalities for greedy algorithms. We
introduce the notion of strong partially greedy Markushevich bases and study the Lebesgue …

The purpose of this paper is to quantify the size of the Lebesgue constants associated with
the thresholding greedy algorithm in terms of a new generation of parameters that modulate …

Equivalence between almost-greedy and semi-greedy bases - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

The goal of this paper is to study the performance of the Thresholding Greedy Algorithm
(TGA) when we increase the size of greedy sums by a constant factor λ⩾ 1. We introduce the …