On Greedy Algorithms with bounded cumulative coherence

MaRDI QIDQ5215713zbMATH OpenFDO

Authors E. D. Livshitz

Publication date 13 February 2020

Full work available at URL https://arxiv.org/abs/0911.1500

Mathematics Subject Classification ID

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

Abstract: We discuss the upper and lower estimates for the rate of convergence of Pure and Orthogonal Greedy Algorithms for dictionary with bounded cumulative coherence.

Cited in

(3)

• scientific article; zbMATH DE number 4155862 (Why is no real title available?)
• scientific article; zbMATH DE number 2079345 (Why is no real title available?)
• On some deterministic dictionaries supporting sparsity

This page was built for publication: On Greedy Algorithms with bounded cumulative coherence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215713)