On greedy algorithms for dictionaries with bounded cumulative coherence

DOI10.1134/S0001434610050159zbMath1281.41011MaRDI QIDQ368218

E. D. Livshits

Publication date: 18 September 2013

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

zbMATH Keywords

rate of convergencegreedy algorithmcumulative coherence

Mathematics Subject Classification ID

Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items (3)

Signal recovery under cumulative coherence ⋮ On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries ⋮ An improved bound of cumulative coherence for signal recovery

Cites Work

• Some remarks on greedy algorithms
• Stable recovery of sparse overcomplete representations in the presence of noise
• Greed is Good: Algorithmic Results for Sparse Approximation
• Greedy approximation

This page was built for publication: On greedy algorithms for dictionaries with bounded cumulative coherence