Greedy algorithm with gaps

DOI10.1016/J.JAT.2017.10.006MaRDI QIDQ1685952zbMATH OpenOpenAlexFDO

Authors T. Oikhberg

Publication date 20 December 2017

Published in Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jat.2017.10.006

zbMATH Keywords

greedy algorithmgreedy basisHaar basisquasi-greedy basis

Mathematics Subject Classification ID

Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) 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

• Greedy in Approximation Algorithms
• Greedy algorithms with prescribed coefficients
• A greedy algorithm for interval greedoids
• A framework for the greedy algorithm
• scientific article; zbMATH DE number 2111760
• A note on greedy algorithm
• scientific article; zbMATH DE number 169611
• Some remarks on greedy algorithms
• The greedy algorithm as a combinatorial principle
• Greedy approximation

Cites work

• Additive bases arising from functions in a Hardy field
• Additive combinatorics
• Characterization of 1-quasi-greedy bases
• Cofinite subsets of asymptotic bases for the positive integers
• Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness
• Greedy algorithm for general biorthogonal systems
• Greedy approximation
• Greedy approximation
• scientific article; zbMATH DE number 3784967 (Why is no real title available?)
• scientific article; zbMATH DE number 914352 (Why is no real title available?)
• scientific article; zbMATH DE number 3271087 (Why is no real title available?)
• Lebesgue constants for the weak greedy algorithm
• Lebesgue inequalities for the greedy algorithm in general bases
• On the existence of almost greedy bases in Banach spaces
• Quasi-greedy bases and Lebesgue-type inequalities
• Restricted Khinchine inequality
• Trigonometric quasi-greedy bases for L^p( T;w)
• Waring's Problem with Polynomial Summands

Cited in

(14)

• Quasi-greedy bases for sequences with gaps
• Characterization of weight-semi-greedy bases
• Bidemocratic bases and their connections with other greedy-type bases
• Performance of the thresholding greedy algorithm with larger greedy sums
• Greedy approximation for biorthogonal systems in quasi-Banach spaces
• Extensions of democracy-like properties for sequences with gaps
• Greedy algorithm for general biorthogonal systems
• Greedy-like bases for sequences with gaps
• Greedy approximation algorithms for sparse collections
• Weak weight-semi-greedy Markushevich bases
• Greedy algorithms: a review and open problems
• Approximation by polynomials with constant coefficients and the thresholding greedy algorithm
• Strong partially greedy bases with respect to an arbitrary sequence
• Enlarge greedy sums in greedy-type properties by different factors

This page was built for publication: Greedy algorithm with gaps

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