The best m-term approximation and greedy algorithms
DOI10.1023/A:1018900431309zbMATH Open0905.65063OpenAlexW30858885MaRDI QIDQ1127004FDOQ1127004
Authors: V. N. Temlyakov
Publication date: 3 January 1999
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018900431309
Recommendations
- On the coincidence of pure greedy and best \(m\)-term approximations
- Efficiency of weak greedy algorithms for \(m\)-term approximations
- Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems
- Simultaneous approximation by greedy algorithms
- Greedy bases are best for \(m\)-term approximation
- Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
- Greedy in Approximation Algorithms
- Optimality of the greedy algorithm for some function classes
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
General theory of numerical analysis in abstract spaces (65J05) Approximation by other special function classes (41A30) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)
Cited In (99)
- Wavelet approximation of distributions with bounded variation derivatives
- Democracy functions and optimal embeddings for approximation spaces
- The best \(m\)-term approximation with respect to polynomials with constant coefficients
- Greedy bases in variable Lebesgue spaces
- Simulation of infinitely divisible random fields
- Wavelet bases in the Lebesgue spaces on the field of \(p\)-adic numbers
- On the \(m\)-term approximation in \(L^1(0, 1)\) in the Haar system
- On greedy algorithm in \(L^{1}(0, 1)\) by regular Haar system
- On the divergence of greedy algorithms with respect to Walsh subsystems in \(L\)
- Greedy approximation for biorthogonal systems in quasi-Banach spaces
- Greedy algorithm for general biorthogonal systems
- On weak non-equivalence of wavelet–like systems in L1
- Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces
- Approximation with brushlet systems.
- Vector greedy algorithms
- Greedy bases for Besov spaces
- Lorentz spaces and embeddings induced by almost greedy bases in superreflexive Banach spaces
- Multivariate \(n\)-term rational and piecewise polynomial approximation
- Nonlinear methods of approximation
- Wavelet bases in the weighted Besov and Triebel-Lizorkin spaces with \(A_p^{\text{loc}}\)-weights
- Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems
- Average best \(m\)-term approximation
- Regression in random design and warped wavelets
- Reconstruction of functions from prescribed proximal points
- Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
- Banach spaces with a unique greedy basis
- On left democracy function
- Adaptive piecewise Poly-Sinc methods for function approximation
- Greedy bases are best for \(m\)-term approximation
- Greedy approximations with regard to bases
- Best basis selection for approximation in \(L_p\)
- Extensions of democracy-like properties for sequences with gaps
- Safe adaptive importance sampling: a mixture approach
- Renorming spaces with greedy bases
- Maximal spaces with given rate of convergence for thresholding algorithms
- Quantifying democracy of wavelet bases in Lorentz spaces
- Wavelets, Orlicz spaces, and greedy bases
- On a greedy algorithm in \(L^{1}(0, 1)\) with regard to subsystems of the Haar system and on \(\omega \)-quasigreedy bases
- Renormings and symmetry properties of 1-greedy bases
- Title not available (Why is that?)
- Best \(m\)-term approximation of the classes \(B_{\infty, \theta}^{r}\) of functions of many variables by polynomials in the Haar system
- Approximations of the classes \(\mathbf{MB}_{p,\theta}^{r}\) of periodic functions of several variables by polynomials according to the Haar system
- Characterization of 1-greedy bases
- On the convergence of a weak greedy algorithm for the multivariate Haar basis
- Approximation of functions in several variables from classes \(H^{\Omega}_p\) by polynomials with respect to the Haar system
- Best approximation with wavelets in weighted Orlicz spaces
- Adaptive algorithms of nonlinear approximation with finite terms
- Greedy bases in \(L^p\) spaces
- Simultaneous approximation by greedy algorithms
- Greedy wavelet projections are bounded on BV
- On the permutative equivalence of squares of unconditional bases
- Projections and Non-Linear Approximation in the Space BV($\mathbb{R}^d$)
- On \(N\) -termed approximations in \(H^s\)-norms with respect to the Haar system
- Greedy algorithm for Besov classes
- Tree approximation and optimal encoding
- On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1)
- Greedy approximation with regard to non-greedy bases
- Nonlinear $N$-term approximation by refinable functions
- An example of an almost greedy uniformly bounded orthonormal basis for \(L_p(0,1)\)
- Algorithms and error bounds for multivariate piecewise constant approximation
- Greedy algorithms and approximation properties for frames in Hilbert spaces
- On the Besov regularity of periodic Lévy noises
- Asymptotic greediness of the Haar system in the spaces \(L_p[0,1]\), \(1<p<\infty \)
- Multiple Haar basis and its properties
- Title not available (Why is that?)
- Characterizations of function spaces on the sphere using frames
- Multiple Haar basis and \(m\)-term approximations for functions from the Besov classes. I
- Greedy approximation and the multivariate Haar system
- Weak thresholding greedy algorithms in Banach spaces
- Democratic systems of translates
- Variations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithms
- Model selection for high-dimensional linear regression with dependent observations
- Rate of convergence of thresholding greedy algorithms
- Characterizations of democratic systems of translates on locally compact abelian groups
- Quasi-greedy bases in \(\ell_p\) (\(0 < p < 1\)) are democratic
- 1-greedy renormings of Garling sequence spaces
- Quasi-greedy bases for sequences with gaps
- Frames and non linear approximations in Hilbert spaces
- Sparse approximation based on a random overcomplete basis
- The thresholding greedy algorithm versus approximations with sizes bounded by certain functions \(f\)
- Results on non-linear approximation for wavelet bases in weighted function spaces
- The convergence constants and non linear approximations of fusion frames
- On the geometry of spaces of homogeneous type and the democracy of Haar systems in Lorentz spaces
- Approximation by Egyptian fractions and the weak greedy algorithm
- Lebesgue inequalities for Chebyshev thresholding greedy algorithms
- REMARKS ON ADAPTIVE FOURIER DECOMPOSITION
- Existence of best \(m\)-term approximation
- On consecutive greedy and other greedy-like type of bases
- The structure of greedy-type bases in Tsirelson's space and its convexifications
- On an approximation algorithm using step functions
- Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
- New parameters and Lebesgue-type estimates in greedy approximation
- Best \(m\)-term one-sided trigonometric approximation of some function classes defined by a kind of multipliers
- Affine Riesz bases and the dual function
- Bidemocratic bases and their connections with other greedy-type bases
- Greedy-like bases for sequences with gaps
- A variational inequality model for the construction of signals from inconsistent nonlinear equations
- Least-squares proper generalized decompositions for weakly coercive elliptic problems
- An example of an almost greedy basis in \(L^1(0,1)\)
This page was built for publication: The best \(m\)-term approximation and greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127004)