Preface |
|
ix | |
|
1 Greedy approximation with regard to bases |
|
|
1 | (76) |
|
|
1 | (5) |
|
1.2 Schauder bases in Banach spaces |
|
|
6 | (9) |
|
|
15 | (18) |
|
1.4 Quasi-greedy and almost greedy bases |
|
|
33 | (6) |
|
1.5 Weak Greedy Algorithms with respect to bases |
|
|
39 | (4) |
|
1.6 Thresholding and minimal systems |
|
|
43 | (4) |
|
1.7 Greedy approximation with respect to the trigonometric system |
|
|
47 | (11) |
|
1.8 Greedy-type bases; direct and inverse theorems |
|
|
58 | (5) |
|
|
63 | (5) |
|
1.10 Systems Lp-equivalent to the Haar basis |
|
|
68 | (8) |
|
|
76 | (1) |
|
2 Greedy approximation with respect to dictionaries: Hilbert spaces |
|
|
77 | (66) |
|
|
77 | (7) |
|
|
84 | (5) |
|
|
89 | (8) |
|
2.4 Greedy algorithms for systems that are not dictionaries |
|
|
97 | (4) |
|
2.5 Greedy approximation with respect to λ-quasi-orthogonal dictionaries |
|
|
101 | (10) |
|
2.6 Lebesgue-type inequalities for greedy approximation |
|
|
111 | (11) |
|
2.7 Saturation property of greedy-type algorithms |
|
|
122 | (13) |
|
|
135 | (6) |
|
|
141 | (2) |
|
|
143 | (40) |
|
3.1 Introduction: definitions and some simple properties |
|
|
143 | (1) |
|
3.2 Finite dimensional spaces |
|
|
144 | (7) |
|
3.3 Trigonometric polynomials and volume estimates |
|
|
151 | (14) |
|
|
165 | (3) |
|
|
168 | (7) |
|
|
175 | (7) |
|
|
182 | (1) |
|
4 Approximation in learning theory |
|
|
183 | (94) |
|
|
183 | (6) |
|
4.2 Some basic concepts of probability theory |
|
|
189 | (17) |
|
4.3 Improper function learning; upper estimates |
|
|
206 | (29) |
|
4.4 Proper function learning; upper estimates |
|
|
235 | (18) |
|
|
253 | (17) |
|
4.6 Application of greedy algorithms in learning theory |
|
|
270 | (7) |
|
5 Approximation in compressed sensing |
|
|
277 | (57) |
|
|
277 | (6) |
|
5.2 Equivalence of three approximation properties of the compressed sensing matrix |
|
|
283 | (4) |
|
5.3 Construction of a good matrix |
|
|
287 | (7) |
|
5.4 Dealing with noisy data |
|
|
294 | (4) |
|
5.5 First results on exact recovery of sparse signals; the Orthogonal Greedy Algorithm |
|
|
298 | (7) |
|
5.6 Exact recovery of sparse signals; the Subspace Pursuit Algorithm |
|
|
305 | (9) |
|
5.7 On the size of incoherent systems |
|
|
314 | (13) |
|
5.8 Restricted Isometry Property for random matrices |
|
|
327 | (3) |
|
|
330 | (2) |
|
|
332 | (2) |
|
6 Greedy approximation with respect to dictionaries: Banach spaces |
|
|
334 | (71) |
|
|
334 | (6) |
|
6.2 The Weak Chebyshev Greedy Algorithm |
|
|
340 | (7) |
|
6.3 Relaxation; co-convex approximation |
|
|
347 | (3) |
|
|
350 | (4) |
|
|
354 | (5) |
|
6.6 Thresholding algorithms |
|
|
359 | (4) |
|
|
363 | (15) |
|
6.8 Relaxation; X-greedy algorithms |
|
|
378 | (3) |
|
6.9 Incoherent dictionaries and exact recovery |
|
|
381 | (4) |
|
6.10 Greedy algorithms with approximate evaluations and restricted search |
|
|
385 | (5) |
|
6.11 An application of greedy algorithms for the discrepancy estimates |
|
|
390 | (14) |
|
|
404 | (1) |
References |
|
405 | (10) |
Index |
|
415 | |