Weak thresholding greedy algorithms in Banach spaces

DOI10.1016/J.JFA.2012.09.011MaRDI QIDQ1932180zbMATH OpenOpenAlexFDO

Authors D. Kutzarova, Th. Schlumprecht, S. J. Dilworth, P. Wojtaszczyk

Publication date 17 January 2013

Published in Journal of Functional Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jfa.2012.09.011

zbMATH Keywords

Banach spacesthresholding greedy algorithmweak thresholdinggreedy approximationbranch greedy algorithm

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)

Recommendations

• Convergence of greedy approximation I. General systems
• The thresholding greedy algorithm, greedy bases, and duality
• Greedy approximation for biorthogonal systems in quasi-Banach spaces
• scientific article; zbMATH DE number 2016952
• On the existence of almost greedy bases in Banach spaces

Cites work

• scientific article; zbMATH DE number 1959425 (Why is no real title available?)
• scientific article; zbMATH DE number 2016952 (Why is no real title available?)
• scientific article; zbMATH DE number 5662770 (Why is no real title available?)
• Characterization of 1-greedy bases
• Greedy algorithm and \(m\)-term trigonometric approximation
• Greedy algorithm for general biorthogonal systems
• Greedy approximation
• Greedy approximations with regard to bases
• On approximate _1 systems in Banach spaces
• On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1)
• On the existence of almost greedy bases in Banach spaces
• Séries de variables aléatoires vectorielles indépendantes et propriétés géométriques des espaces de Banach
• The best \(m\)-term approximation and greedy algorithms
• The entropy in learning theory. Error estimates
• The thresholding greedy algorithm, greedy bases, and duality

Cited in

(17)

• Lebesgue constants for Chebyshev thresholding greedy algorithms
• On the existence of almost greedy bases in Banach spaces
• Greedy approximation for biorthogonal systems in quasi-Banach spaces
• The weighted property (A) and the greedy algorithm
• Weak convergence of greedy algorithms in Banach spaces
• Quasi-greedy bases for sequences with gaps
• Efficiency of weak greedy algorithms for m-term approximations
• The thresholding greedy algorithm, greedy bases, and duality
• Greedy algorithms with restricted depth search
• The thresholding greedy algorithm versus approximations with sizes bounded by certain functions \(f\)
• Weak forms of unconditionality of bases in greedy approximation
• The weak Chebyshev X-greedy algorithm in the unweighted Bergman space
• Extensions of democracy-like properties for sequences with gaps
• On the convergence of a weak greedy algorithm for the multivariate Haar basis
• Lebesgue constants for the weak greedy algorithm
• Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
• Greedy-like bases for sequences with gaps

This page was built for publication: Weak thresholding greedy algorithms in Banach spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932180)