Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries

DOI10.1006/jath.1998.3265zbMath0926.65050OpenAlexW2154908766MaRDI QIDQ1288881

Vladimir N. Temlyakov

Publication date: 22 November 1999

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jath.1998.3265

zbMATH Keywords

numerical examplesimage processingHilbert spacesignal processinggreedy algorithmsdictionaries\(M\)-term approximation

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Computing methodologies for image processing (68U10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Algorithms for approximation of functions (65D15)

Related Items (23)

Convex optimization on Banach spaces ⋮ The best \(M\)-term trigonometric approximations of the classes of periodic multivariate functions with bounded generalized derivative in the space \(L_q\) ⋮ SOTT: Greedy Approximation of a Tensor as a Sum of Tensor Trains ⋮ On Lebesgue-type inequalities for greedy approximation ⋮ Convergence and rate of convergence of some greedy algorithms in convex optimization ⋮ Sparse approximation is provably hard under coherent dictionaries ⋮ Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations ⋮ Super greedy type algorithms ⋮ A note on the hardness of sparse approximation ⋮ Vector greedy algorithms ⋮ Greedy expansions in convex optimization ⋮ Sparse approximation based on a random overcomplete basis ⋮ Low rank Tucker-type tensor approximation to classical potentials ⋮ Tensor-product approximation to operators and functions in high dimensions ⋮ Decomposition of functions into pairs of intrinsic mode functions ⋮ Analysis of the self projected matching pursuit algorithm ⋮ Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations ⋮ Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems ⋮ Simultaneous approximation by greedy algorithms ⋮ Sparse signal representation by adaptive non-uniform B-spline dictionaries on a compact interval ⋮ Cardinal B-spline dictionaries on a compact interval ⋮ Adaptive martingale approximations ⋮ Numerical Computation for Orthogonal Low-Rank Approximation of Tensors

Cites Work

• The best \(m\)-term approximation and greedy algorithms
• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Greedy algorithm and \(m\)-term trigonometric approximation
• Rates of convex approximation in non-Hilbert spaces
• Nonlinear approximation in finite-dimensional spaces
• Some remarks on greedy algorithms
• Compression of Wavelet Decompositions
• Universal approximation bounds for superpositions of a sigmoidal function
• Adaptive greedy approximations

This page was built for publication: Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries