On optimal estimate of the block orthogonal greedy algorithm for g-frames
DOI10.1080/01630563.2021.1960860zbMATH Open1481.42040OpenAlexW3195448454MaRDI QIDQ3385358FDOQ3385358
Authors: Khole Timothy Poumai, Sunder Deep, Shiv K. Kaushik 
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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Compressed sensing
- Greed is Good: Algorithmic Results for Sparse Approximation
- A Class of Nonharmonic Fourier Series
- Greedy approximation
- An introduction to frames and Riesz bases
- Fusion frames and distributed processing
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- \(g\)-frames and \(g\)-Riesz bases
- The art of frame theory
- On Lebesgue-type inequalities for greedy approximation
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
- Title not available (Why is that?)
- On performance of greedy algorithms
- Robust Recovery of Signals From a Structured Union of Subspaces
- An Introduction to Frames
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations
- Wavelets, Frames and Operator Theory
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)
