Approximation properties of some vector weak biorthogonal greedy algorithms
From MaRDI portal
Cites work
- A Framework of Adaptive Multiscale Wavelet Decomposition for Signals on Undirected Graphs
- A theory for multiresolution signal decomposition: the wavelet representation
- A unified way of analyzing some greedy algorithms
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Approximation and learning by greedy algorithms
- Biorthogonal greedy algorithms in convex optimization
- Compressed sensing and best \(k\)-term approximation
- Convex multi-task feature learning
- 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 strategies for convex optimization
- Hyperspectral image classification using wavelet transform-based smooth ordering
- On the theory of linear and nonlinear integral equations. I: Expansion of arbitrary functions by fixed function systems. II: Solution of the general linear integral equation
- On tracial approximation
- Relaxation in greedy approximation
- Simultaneous approximation by greedy algorithms
- Simultaneous greedy approximation in Banach spaces
- Some remarks on greedy algorithms
- Two lower estimates in greedy approximation
- Unified error estimate for weak biorthogonal greedy algorithms
- Vector greedy algorithms
- Weak greedy algorithms
This page was built for publication: Approximation properties of some vector weak biorthogonal greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034053)
