Greedy algorithm with gaps
From MaRDI portal
Publication:1685952
DOI10.1016/j.jat.2017.10.006zbMath1381.41034OpenAlexW2765197418MaRDI QIDQ1685952
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
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) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Related Items (6)
Extensions of democracy-like properties for sequences with gaps ⋮ Greedy-like bases for sequences with gaps ⋮ Bidemocratic bases and their connections with other greedy-type bases ⋮ Performance of the thresholding greedy algorithm with larger greedy sums ⋮ Quasi-greedy bases for sequences with gaps ⋮ Characterization of weight-semi-greedy bases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Additive bases arising from functions in a Hardy field
- Characterization of 1-quasi-greedy bases
- Cofinite subsets of asymptotic bases for the positive integers
- Lebesgue inequalities for the greedy algorithm in general bases
- Trigonometric quasi-greedy bases for \(L^p(\mathbf T;w)\)
- Lebesgue constants for the weak greedy algorithm
- Restricted Khinchine Inequality
- Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness
- Greedy Approximation
- Quasi-greedy bases and Lebesgue-type inequalities
- Greedy approximation
- Waring's Problem with Polynomial Summands
- On the existence of almost greedy bases in Banach spaces
- Greedy algorithm for general biorthogonal systems
This page was built for publication: Greedy algorithm with gaps
