Greedy algorithms and approximation properties for frames in Hilbert spaces
From MaRDI portal
Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) General harmonic expansions, frames (42C15) Completeness of sets of functions in nontrigonometric harmonic analysis (42C30) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)
Recommendations
- On optimal estimate of the block orthogonal greedy algorithm for g-frames
- Frames and non linear approximations in Hilbert spaces
- scientific article; zbMATH DE number 7062135
- On Lebesgue-type inequalities for greedy approximation
- On greedy algorithms for dictionaries with bounded cumulative coherence
Cites work
- A basis theory primer.
- An introduction to frames and Riesz bases
- Approximation and learning by greedy algorithms
- Frames and non linear approximations in Hilbert spaces
- Frames and the projection method
- Greedy approximation
- scientific article; zbMATH DE number 1215245 (Why is no real title available?)
- On Lebesgue-type inequalities for greedy approximation
- On performance of greedy algorithms
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
- Some remarks on greedy algorithms
- The best m-term approximation and greedy algorithms
- The thresholding greedy algorithm, greedy bases, and duality
- Universal approximation bounds for superpositions of a sigmoidal function
Cited in
(6)- Frames and non linear approximations in Hilbert spaces
- A note on greedy algorithm
- Rescaled pure greedy algorithm for Hilbert and Banach spaces
- On optimal estimate of the block orthogonal greedy algorithm for g-frames
- scientific article; zbMATH DE number 7062135 (Why is no real title available?)
- On greedy types frame systems
This page was built for publication: Greedy algorithms and approximation properties for frames in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4631277)
