✦ LIBER ✦

Super greedy type algorithms

✍ Scribed by Liu, Entao; Temlyakov, Vladimir N.

Book ID: 118070116
Publisher: Springer
Year: 2011
Tongue: English
Weight: 329 KB
Volume: 37
Category: Article
ISSN: 1019-7168
DOI: 10.1007/s10444-011-9220-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hereditary systems and greedy-type algor

Hereditary systems and greedy-type algorithms

✍ Victor Il'ev 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 167 KB

We deÿne a hereditary system on a ÿnite set U as a partition of the family 2 U of all subsets of U into disjoint families A and D satisfying (A ∈ A; respectively. The members of A are called independent sets, the sets D ∈ D are called dependent. We consider two important special cases of hereditary

The Orthogonal Super Greedy Algorithm an

The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing

✍ Liu, E.; Temlyakov, V.N. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 216 KB

Vector greedy algorithms

✍ Adam Lutoborski; Vladimir N. Temlyakov 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Our objective is to study nonlinear approximation with regard to redundant systems. Redundancy on the one hand offers much promise for greater efficiency in terms of approximation rate, but on the other hand gives rise to highly nontrivial theoretical and practical problems. Greedy-type approximatio

Approximate Weak Greedy Algorithms

✍ R. Gribonval; M. Nielsen 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 149 KB

Realizability of greedy algorithms

✍ E. D. Livshits 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 377 KB

Advances in greedy algorithms

✍ Bednorz W. 📂 Library 📅 2008 🌐 English ⚖ 8 MB

Each chapter comprises a separate study on some optimization problem giving both an introductory look into the theory the problem comes from and some new developments invented by author(s). Usually some elementary knowledge is assumed, yet all the required facts are quoted mostly in examples, remark