Search Results - thresholding greedy algorithm

Democracy of quasi-greedy bases in -Banach spaces with applications to the efficiency of the Thresholding Greedy Algorithm in the Hardy spaces by Albiac, Fernando, Ansorena, José L., Bello, Glenier

“…We use new methods, specific for non-locally convex quasi-Banach spaces, to investigate when the quasi-greedy bases of a $p$ -Banach space for $0< p<1$ are democratic…”
Get full text

Performance of the Thresholding Greedy Algorithm with larger greedy sums by Chu, Hùng Việt

“…The goal of this paper is to study the performance of the Thresholding Greedy Algorithm (TGA…”
Get full text

The thresholding greedy algorithm versus approximations with sizes bounded by certain functions f by Chu, Hùng Việt

“… (closed under composition), we define and characterize f-greedy and f-almost greedy bases…”
Get full text

Lebesgue inequalities for Chebyshev thresholding greedy algorithms by Berná, P. M., Blasco, Ó., Garrigós, G., Hernández, E., Oikhberg, T.

“…We establish estimates for the Lebesgue parameters of the Chebyshev weak thresholding greedy algorithm in the case of general bases in Banach spaces…”
Get full text

Democracy of quasi-greedy bases in $\boldsymbol p$-Banach spaces with applications to the efficiency of the Thresholding Greedy Algorithm in the Hardy spaces $\boldsymbol {H_{p}({\mathbb {D}}^{d})} by Albiac, Fernando, Ansorena, José L., Bello, Glenier

“…We use new methods, specific for non-locally convex quasi-Banach spaces, to investigate when the quasi-greedy bases of a $p$-Banach space for $0< p<1$ are democratic…”
Get full text

On convergence of Weak Thresholding Greedy Algorithm in L 1 ( 0 , 1 ) by Gogyan, Smbat

“…For any 0 < t < 1 we construct a Weak Thresholding Greedy Algorithm with weakness parameter t which converges in L 1 ( 0 , 1…”
Get full text

Variations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithms by Chu, Hùng Việt

“… generalized the concept to C-Property (A), where the case C=1 gives property (A). They (among other results) characterized greedy bases by unconditionality and C-property…”
Get full text

Lebesgue constants for Chebyshev thresholding greedy algorithms by Shao, Chunfang, Ye, Peixin

“…We investigate the efficiency of Chebyshev Thresholding Greedy Algorithm (CTGA) for an n -term approximation with respect to general bases in a Banach space…”
Get full text

Weak thresholding greedy algorithms in Banach spaces by Dilworth, S.J., Kutzarova, Denka, Schlumprecht, Th, Wojtaszczyk, P.

“…We consider weak thresholding greedy algorithms with respect to Markushevich bases in general Banach spaces…”
Get full text

The Thresholding Greedy Algorithm, Greedy Bases, and Duality by Dilworth, S.J., Kalton, N.J., Kutzarova, Denka, Temlyakov, V.N.

Get full text

Twenty-five years of greedy bases by Albiac, Fernando, Ansorena, José L., Temlyakov, Vladimir

“… Temlyakov, A remark on greedy approximation in Banach spaces, East J. Approx. 5 (3) (1999), 365-379]. The theoretical simplicity of the thresholding greedy algorithm…”
Get full text

Elton's near unconditionality of bases as a threshold-free form of greediness by Albiac, Fernando, Ansorena, José L., Berasategui, Miguel

“… Finally, we make a contribution to the isometric theory of greedy bases by characterizing those bases that are 1-quasi-greedy for largest coefficients…”
Get full text

Linear versus nonlinear forms of partial unconditionality of bases by Albiac, Fernando, Ansorena, José L., Berasategui, Miguel

“… that appear naturally in the study of the performance of the thresholding greedy algorithm in Banach spaces…”
Get full text

Counterexamples in isometric theory of symmetric and greedy bases by Albiac, Fernando, Ansorena, José L., Blasco, Óscar, Chu, Hùng Việt, Oikhberg, Timur

“…We continue the study initiated in Albiac and Wojtaszczyk (2006) of properties related to greedy bases in the case when the constants involved are sharp, i.e…”
Get full text

Bidemocratic Bases and Their Connections with Other Greedy-Type Bases by Albiac, Fernando, Ansorena, José L., Berasategui, Miguel, Berná, Pablo M., Lassalle, Silvia

“…In nonlinear greedy approximation theory, bidemocratic bases have traditionally played the role of dualizing democratic, greedy, quasi-greedy, or almost greedy bases…”
Get full text

On some characterizations of greedy-type bases by Berná, Pablo M., Chu, Hùng Việt

“…In 1999, S. V. Konyagin and V. N. Temlyakov introduced the so-called Thresholding Greedy Algorithm…”
Get full text

Relaxations of the Optimality Requirement on the Thresholding Greedy Algorithm for Bases of Banach Spaces by Chu, Húng Viêt

“…) by nonlinear algorithms. In 1999, Koyagin and Temlyakov gave an early formalization of such an algorithm, called the Thresholding Greedy Algorithm (TGA…”
Get full text

On sequential greedy-type bases: On sequential greedy-type bases by Berasategui, Miguel, Berná, Pablo M., Chu, Hùng Việt

“…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 intervals or in other…”
Get full text

Lebesgue inequalities for the greedy algorithm in general bases by Berná, Pablo M., Blasco, Óscar, Garrigós, Gustavo

“…We present various estimates for the Lebesgue type inequalities associated with the thresholding greedy algorithm, in the case of general bases in Banach spaces…”
Get full text

Characterization of 1-quasi-greedy bases by Albiac, F., Ansorena, J.L.

“…In this note we continue the study initiated in Albiac and Wojtaszczyk (2006) of greedy-like bases in the “isometric case”, i.e…”
Get full text