Error bounds of approximate weak rescaled pure greedy algorithms
\(K\)-functionalapproximate weak rescaled pure greedy algorithmsconvergence conditionconvergence ratefractalsstabilitytrigonometric systemwavelet bases
Rate of convergence, degree of approximation (41A25) 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) Geometry and structure of normed linear spaces (46B20) Numerical methods for wavelets (65T60)
- A Framework of Adaptive Multiscale Wavelet Decomposition for Signals on Undirected Graphs
- A theory for multiresolution signal decomposition: the wavelet representation
- Adaptive greedy approximations
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
- Approximate weak greedy algorithms
- Approximation and learning by greedy algorithms
- Compression of Wavelet Decompositions
- Efficiency of the weak Rescaled Pure Greedy Algorithm
- Efficiency of weak greedy algorithms for m-term approximations
- Fractional calculus, zeta functions and Shannon entropy
- Fractional-Wavelet Analysis of Positive definite Distributions and Wavelets on $$\varvec{\mathscr {D'}}(\mathbb {C})$$ D ′ ( C )
- Greedy algorithms in Banach spaces
- Greedy approximation
- Greedy approximation with regard to non-greedy bases
- Greedy strategies for convex optimization
- scientific article; zbMATH DE number 3115215 (Why is no real title available?)
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- Hyperspectral image classification using wavelet transform-based smooth ordering
- Matching pursuits with time-frequency dictionaries
- Nonlinear approximation by trigonometric sums
- Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
- On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces
- On the rate of convergence of a pure greedy algorithm.
- On the rate of convergence of greedy algorithms.
- On the Weierstrass-Mandelbrot fractal function
- On tracial approximation
- Optimality of the rescaled pure greedy learning algorithms
- Rate of convergence of pure greedy algorithm.
- Rates of convex approximation in non-Hilbert spaces
- Rescaled pure greedy algorithm for convex optimization
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- Simultaneous greedy approximation in Banach spaces
- Some remarks on greedy algorithms
- Sparse signals recovery from noisy measurements by orthogonal matching pursuit
- Two lower estimates in greedy approximation
- Using the matrix refinement equation for the construction of wavelets on invariant sets
- Vector greedy algorithms
This page was built for publication: Error bounds of approximate weak rescaled pure greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962153)
