On the optimality of the Orthogonal Greedy Algorithm for μ-coherent dictionaries

被引：13

作者：

Livshitz, E. D. ^{[1
]}

机构：

[1] Moscow MV Lomonosov State Univ, Moscow 119992, Russia

来源：

JOURNAL OF APPROXIMATION THEORY | 2012年 / 164卷 / 05期

基金：

俄罗斯基础研究基金会;

关键词：

Orthogonal Greedy Algorithms; Orthogonal Matching Pursuit; Best m-term approximation; Lebesgue-type inequalities; CONSTRUCTIONS;

D O I：

10.1016/j.jat.2012.01.007

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this article, we continue to study the performance of Greedy Algorithms. We show that the Orthogonal Greedy Algorithm (Orthogonal Matching Pursuit) provides an almost optimal approximation on the first [mu(-1)/20] steps for mu-coherent dictionaries. (C) 2012 Elsevier Inc. All rights reserved.

引用

页码：668 / 681

页数：14