4 citations · 5 across the 7 of their papers we have counts for
13 papers
Isometric renormings for greedy bases in Banach spaces, with applications to the Haar System in ,
Fernando Albiac, José L. Ansorena, Miguel Berasategui +1
We investigate the problem of improving the greedy-type constant of a basis by means of an equivalent renorming of the ambient Banach space. Our main result shows that if a Banach…
On sequential greedy-type bases
Miguel Berasategui, Pablo M. Berná, Hung Viet Chu
It is known that a basis is almost greedy if and only if the thresholding greedy algorithm gives essentially the smallest error term compared to errors from projections onto interv…
Weaker forms of unconditionality of bases in greedy approximation
Fernando Albiac, Jose L. Ansorena, Miguel Berasategui +2
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…
Bidemocratic bases and their connections with other greedy-type bases
Fernando Albiac, Jose L. Ansorena, Miguel Berasategui +2
In nonlinear greedy approximation theory, bidemocratic bases have traditionally played the role of dualizing democratic, greedy, quasi-greedy, or almost greedy bases. In this artic…
New parameters and Lebesgue-type estimates in greedy approximation
Fernando Albiac, Jose L. Ansorena, Pablo M. Berna
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…
Strong partially greedy bases and Lebesgue-type inequalities
Miguel Berasategui, Pablo M. Berná, Silvia Lassalle
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 Lebesgu…