Efficiency of weak greedy algorithms for \(m\)-term approximations
From MaRDI portal
Publication:294506
DOI10.1007/s11425-015-5106-1zbMath1342.41023OpenAlexW2316814701MaRDI QIDQ294506
Publication date: 16 June 2016
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-015-5106-1
Lebesgue constants\(m\)-term approximationquasi-greedy basesweak Chebyshev greedy algorithmweak thresholding greedy algorithm
Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Related Items (2)
Lebesgue constants for Chebyshev thresholding greedy algorithms ⋮ Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lebesgue-type inequalities for quasi-greedy bases
- Equivalent boundedness of Marcinkiewicz integrals on non-homogeneous metric measure spaces
- Robustness of orthogonal matching pursuit under restricted isometry property
- Approximation of monogenic functions by higher order Szegő kernels on the unit ball and half space
- Analysis of orthogonal multi-matching pursuit under restricted isometry property
- Interpolation of Morrey-Campanato and related smoothness spaces
- Greedy algorithm and \(m\)-term trigonometric approximation
- Nonlinear approximation by trigonometric sums
- Nonlinear methods of approximation
- The thresholding greedy algorithm, greedy bases, and duality
- Convergence of some greedy algorithms in Banach spaces
- Some remarks on greedy algorithms
- Hardy spaces \(H^p\) over non-homogeneous metric measure spaces and their applications
- Lebesgue constants for the weak greedy algorithm
- Greedy approximation with regard to non-greedy bases
- An example of an almost greedy uniformly bounded orthonormal basis for \(L_p(0,1)\)
- SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
- Quasi-greedy bases and Lebesgue-type inequalities
- Greedy approximation
- On the existence of almost greedy bases in Banach spaces
- Biorthogonal systems in Banach spaces
- Greedy algorithm for general biorthogonal systems
- Greedy algorithms in Banach spaces
This page was built for publication: Efficiency of weak greedy algorithms for \(m\)-term approximations