Related papers: A remark on approximation with polynomials and gre…
Greedy bases are those bases where the Thresholding Greedy Algorithm (introduced by S. V. Konyagin and V. N. Temlyakov) produces the best possible approximation up to a constant. In 2017, Bern\'a and Blasco gave a characterization of these…
In this paper we show that that greedy bases can be defined as those where the error term using $m$-greedy approximant is uniformly bounded by the best $m$-term approximation with respect to polynomials with constant coefficients in the…
This paper is devoted to theoretical aspects on optimality of sparse approximation. We undertake a quantitative study of new types of greedy-like bases that have recently arisen in the context of nonlinear $m$-term approximation in Banach…
We shall present a new characterization of greedy bases and 1-greedy bases in terms of certain functionals defined using distances to one dimensional subspaces generated by the basis. We also introduce a new property that unifies the…
The purpose of this paper is to introduce $\omega$-Chebyshev-greedy and $\omega$-partially greedy approximation classes and to study their relation with $\omega$-approximation spaces, where the latter are a generalization of the classical…
The purpose of this paper is to quantify the size of the Lebesgue constants $(L_m)_{m=1}^{\infty}$ associated with the thresholding greedy algorithm in terms of a new generation of parameters that modulate accurately some features of a…
Let $X$ be a Banach space and $(e_n)_{n=1}^\infty$ be a basis. For a function $f$ in a large collection $\mathcal{F}$ (closed under composition), we define and characterize $f$-greedy and $f$-almost greedy bases. We study relations among…
We show that for quasi-greedy bases in real Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N-term error of approximation times a constant which depends on the democracy functions and the…
We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N- term error of approximation times a function of N which depends on the democracy…
In 2003, S. J. Dilworth et al. ([8]) introduced the notion of almost-greedy (resp. partially-greedy) bases. These bases were characterized in terms of quasi-greediness and democracy (resp. conservativeness). In this paper we will show a new…
We study the problem of improving the greedy constant or the democracy constant of a basis of a Banach space by renorming. We prove that every Banach space with a greedy basis can be renormed, for a given $\vare>0$, so that the basis…
We construct two counterexamples that resolve long-standing open problems on greedy approximation theory with respect to bases, posed in [F. Albiac et al., Dissertationes Math. 560 (2021)] and restated in [F. Albiac, J. L. Ansorena, V.…
The theory of greedy-like bases started in 1999 when S. V. Konyagin and V. N. Temlyakov introduced in \cite{KT} the famous Thresholding Greedy Algorithm. Since this year, different greedy-like bases appeared in the literature, as for…
The main results in this paper contribute to bring to the fore novel underlying connections between the contemporary concepts and methods springing from greedy approximation theory with the well established techniques of classical Banach…
We introduce the notion of a \textit{weight-almost greedy} basis and show that a basis for a real Banach space is $w$-almost greedy if and only if it is both quasi-greedy and $w$-democratic. We also introduce the notion of…
We obtain Lebesgue-type inequalities for the greedy algorithm for arbitrary complete seminormalized biorthogonal systems in Banach spaces. The bounds are given only in terms of the upper democracy functions of the basis and its dual. We…
We continue with the study of greedy-type bases in quasi-Banach spaces started in [3]. In this paper, we study partially-greedy bases focusing our attention in two main results: -Characterization of partially-greedy bases in quasi-Banach…
This article closes the cycle of characterizations of greedy-like bases in the isometric case initiated in [F. Albiac and P. Wojtaszczyk, Characterization of $1$-greedy bases, J. Approx. Theory 138 (2006)] with the characterization of…
For two countable ordinals $\alpha$ and $\beta$, a basis of a Banach space $X$ is said to be $(\alpha, \beta)$-quasi-greedy if it is 1) quasi-greedy, 2) $\mathcal{S}_\alpha$-unconditional but not $\mathcal{S}_{\alpha+1}$-unconditional, and…
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 Markushevich bases) in quasi-Banach spaces from a functional-analytic…