On \(n\)-term approximation with positive coefficients

DOI10.1134/S0001434607090052zbMath1156.41008MaRDI QIDQ942052

E. D. Livshits

Publication date: 3 September 2008

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

polynomial approximationgreedy algorithmapproximation theoryredundant systempositive dictionary

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by other special function classes (41A30)

Related Items (3)

Conical greedy algorithm ⋮ Greedy approximation by arbitrary sets ⋮ Example of divergence of a greedy algorithm with respect to an asymmetric dictionary

Cites Work

• Unnamed Item
• Unnamed Item
• Relaxation in greedy approximation
• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Rates of convex approximation in non-Hilbert spaces
• A criterion for convergence of weak greedy algorithms
• Some remarks on greedy algorithms
• Weak greedy algorithms
• Approximation and learning by greedy algorithms
• Generalized approximate weak greedy algorithms

This page was built for publication: On \(n\)-term approximation with positive coefficients