Efficiency of the weak Rescaled Pure Greedy Algorithm
DOI10.1142/S0219691321500016zbMath1478.41010OpenAlexW3141829191MaRDI QIDQ5010120
Publication date: 24 August 2021
Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219691321500016
Best approximation, Chebyshev systems (41A50) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Information theory (general) (94A15) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Rates of convex approximation in non-Hilbert spaces
- Two lower estimates in greedy approximation
- Some remarks on greedy algorithms
- Weak greedy algorithms
- A unified way of analyzing some greedy algorithms
- Approximation and learning by greedy algorithms
- Generalized approximate weak greedy algorithms
- Efficient image fusion with approximate sparse representation
- Compressed sensing and best 𝑘-term approximation
- Greedy Approximation
- Matching pursuits with time-frequency dictionaries
- Unconditional convergence constants of g-frame expansions
- The convergence properties of orthogonal rational functions on the extended real line and analytic on the upper half plane
- A tree-based dictionary learning framework
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
- Greedy algorithms in Banach spaces
- Approximate weak greedy algorithms
This page was built for publication: Efficiency of the weak Rescaled Pure Greedy Algorithm
