Lebesgue constants for the weak greedy algorithm

DOI10.1007/S13163-014-0163-5MaRDI QIDQ2348348zbMATH OpenOpenAlexFDO

Authors D. Kutzarova, S. J. Dilworth, T. Oikhberg

Publication date 12 June 2015

Published in Revista Matemática Complutense (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13163-014-0163-5

zbMATH Keywords

biorthogonal systemLebesgue constantMarkushevitch basisweak greedy algorithm

Mathematics Subject Classification ID

Approximation by other special function classes (41A30) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases in topological vector spaces (46A35) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)

Recommendations

• Lebesgue inequalities for Chebyshev thresholding greedy algorithms
• Lebesgue inequalities for the greedy algorithm in general bases
• Weak thresholding greedy algorithms in Banach spaces
• Lebesgue constants for Chebyshev thresholding greedy algorithms
• Lebesgue-type inequalities for quasi-greedy bases

Cites work

• A remark on greedy approximation in Banach spaces.
• Biorthogonal systems in Banach spaces
• Conditional quasi-greedy bases in Hilbert and Banach spaces
• Greedy algorithm for general biorthogonal systems
• Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems
• Greedy approximation
• Greedy approximation
• Greedy approximation with regard to non-greedy bases
• scientific article; zbMATH DE number 1959425 (Why is no real title available?)
• scientific article; zbMATH DE number 2016952 (Why is no real title available?)
• Lebesgue-type inequalities for greedy approximation with respect to quasi-greedy bases
• Lebesgue-type inequalities for quasi-greedy bases
• On the existence of almost greedy bases in Banach spaces
• Quasi-greedy bases and Lebesgue-type inequalities
• Special Banach lattices and their applications.
• The thresholding greedy algorithm, greedy bases, and duality
• Trigonometric quasi-greedy bases for L^p( T;w)

Cited in

(22)

• A criterion for convergence of weak greedy algorithms
• Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces
• Lebesgue inequalities for the greedy algorithm in general bases
• Greedy algorithm with gaps
• Equivalence between almost-greedy and semi-greedy bases
• Quasi-greedy bases for sequences with gaps
• Strong partially greedy bases and Lebesgue-type inequalities
• Variations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithms
• Lebesgue inequalities for Chebyshev thresholding greedy algorithms
• Characterization of weight-semi-greedy bases
• The weighted property (A) and the greedy algorithm
• Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
• Weak convergence of a greedy algorithm and the WN-property
• Efficiency of weak greedy algorithms for m-term approximations
• On the generalized approximate weak Chebyshev greedy algorithm
• New parameters and Lebesgue-type estimates in greedy approximation
• Extensions of democracy-like properties for sequences with gaps
• Greedy-like bases for sequences with gaps
• Linear versus nonlinear forms of partial unconditionality of bases
• Weak weight-semi-greedy Markushevich bases
• Enlarge greedy sums in greedy-type properties by different factors
• Lebesgue constants for Chebyshev thresholding greedy algorithms

This page was built for publication: Lebesgue constants for the weak greedy algorithm

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