Efficiency of the weak Rescaled Pure Greedy Algorithm
From MaRDI portal
Information theory (general) (94A15) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Recommendations
- Approximate weak greedy algorithms
- Convergence of some greedy algorithms in Banach spaces
- Greedy approximation in Banach spaces
- scientific article; zbMATH DE number 2111760
- Rescaled pure greedy algorithm for convex optimization
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces
- Greedy approximation and the multivariate Haar system
- scientific article; zbMATH DE number 5024023
- Weak greedy algorithms
Cites work
- scientific article; zbMATH DE number 3626044 (Why is no real title available?)
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- A tree-based dictionary learning framework
- A unified way of analyzing some greedy algorithms
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
- Approximate weak greedy algorithms
- Approximation and learning by greedy algorithms
- Compressed sensing and best \(k\)-term approximation
- Efficient image fusion with approximate sparse representation
- Generalized approximate weak greedy algorithms
- Greedy algorithms in Banach spaces
- Greedy approximation
- Matching pursuits with time-frequency dictionaries
- On convergence of weak greedy algorithms
- Rate of convergence of pure greedy algorithm.
- Rates of convex approximation in non-Hilbert spaces
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Some remarks on greedy algorithms
- The convergence properties of orthogonal rational functions on the extended real line and analytic on the upper half plane
- Two lower estimates in greedy approximation
- Unconditional convergence constants of g-frame expansions
- Weak greedy algorithms
Cited in
(5)- Error bounds of approximate weak rescaled pure greedy algorithms
- Reproducing property of bounded linear operators and kernel regularized least square regressions
- Unified error estimate for weak biorthogonal greedy algorithms
- Optimality of the rescaled pure greedy learning algorithms
- Approximate weak greedy algorithms
This page was built for publication: Efficiency of the weak Rescaled Pure Greedy Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5010120)
