On Optimal Estimate of the Block Orthogonal Greedy Algorithm for g-Frames
DOI10.1080/01630563.2021.1960860zbMath1481.42040OpenAlexW3195448454MaRDI QIDQ3385358
Sunder Deep, S. K. Kaushik, Khole Timothy Poumai
Publication date: 18 December 2021
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2021.1960860
Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) General harmonic expansions, frames (42C15) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15) Completeness of sets of functions in nontrigonometric harmonic analysis (42C30)
Cites Work
- Unnamed Item
- Unnamed Item
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
- On performance of greedy algorithms
- Fusion frames and distributed processing
- The art of frame theory
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations
- \(g\)-frames and \(g\)-Riesz bases
- On Lebesgue-type inequalities for greedy approximation
- Greedy Approximation
- An Introduction to Frames
- Greed is Good: Algorithmic Results for Sparse Approximation
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Wavelets, Frames and Operator Theory
- Robust Recovery of Signals From a Structured Union of Subspaces
- A Class of Nonharmonic Fourier Series
- Compressed sensing
- An introduction to frames and Riesz bases
This page was built for publication: On Optimal Estimate of the Block Orthogonal Greedy Algorithm for g-Frames
