Super greedy type algorithms

We study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy algorithms. We call such greedy algorithms super greedy type algorithms . The super greedy type algorithms are computationally simpler than their...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Advances in computational mathematics Ročník 37; číslo 4; s. 493 - 504
Hlavní autori: Liu, Entao, Temlyakov, Vladimir N.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer US 01.11.2012
Predmet:
Computational Mathematics and Numerical Analysis
Computational Science and Engineering
Mathematical and Computational Biology
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Visualization
Primary 41A65; Secondary 41A25
41A46
Thresholding
Incoherent dictionary
Convergence rate
46B20
Super greedy algorithms
ISSN:1019-7168, 1572-9044
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy algorithms. We call such greedy algorithms super greedy type algorithms . The super greedy type algorithms are computationally simpler than their analogues from the standard greedy algorithms. In this article, we propose the Weak Super Greedy Algorithm (WSGA) and the Weak Orthogonal Super Greedy Algorithm with Thresholding (WOSGAT). Their performance (rate of convergence) are studied as well under M -coherent dictionaries.
ISSN:1019-7168
1572-9044
DOI:10.1007/s10444-011-9220-5