On optimal estimate of the block orthogonal greedy algorithm for g-frames
From MaRDI portal
Publication:3385358
General harmonic expansions, frames (42C15) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) 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
Cites work
- scientific article; zbMATH DE number 47995 (Why is no real title available?)
- scientific article; zbMATH DE number 2079345 (Why is no real title available?)
- A Class of Nonharmonic Fourier Series
- An Introduction to Frames
- An introduction to frames and Riesz bases
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Compressed sensing
- Fusion frames and distributed processing
- Greed is Good: Algorithmic Results for Sparse Approximation
- Greedy approximation
- On Lebesgue-type inequalities for greedy approximation
- On performance of greedy algorithms
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
- Robust Recovery of Signals From a Structured Union of Subspaces
- The art of frame theory
- Wavelets, Frames and Operator Theory
- \(g\)-frames and \(g\)-Riesz bases
Cited in
(2)
This page was built for publication: On optimal estimate of the block orthogonal greedy algorithm for g-frames
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3385358)