We consider biorthogonal systems in quasi-Banach spaces such that the greedy algorithm converges for each x # X (quasi-greedy systems). We construct quasigreedy conditional bases in a wide range of Banach spaces. We also compare the greedy algorithm for the multidimensional Haar system with the opti
β¦ LIBER β¦
Thresholds: A Greedy Algorithm for E-Systems Management
β Scribed by L. Lawrence Ho
- Book ID
- 110274026
- Publisher
- Springer US
- Year
- 2000
- Tongue
- English
- Weight
- 46 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1064-7570
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Greedy Algorithm for General Biorthogona
β
P. Wojtaszczyk
π
Article
π
2000
π
Elsevier Science
π
English
β 189 KB
K-greedy algorithms for independence sys
β
D. Hausmann; B. Korte
π
Article
π
1978
π
Springer
π
English
β 367 KB
Neighbor Systems and the Greedy Algorith
β
Hartvigsen, David
π
Article
π
2010
π
Society for Industrial and Applied Mathematics
π
English
β 394 KB
A greedy algorithm for supervised discre
β
Richard Butterworth; Dan A. Simovici; Gustavo S. Santos; Lucila Ohno-Machado
π
Article
π
2004
π
Elsevier Science
π
English
β 399 KB
A greedy algorithm for convex geometries
β
Kenji Kashiwabara; Yoshio Okamoto
π
Article
π
2003
π
Elsevier Science
π
English
β 308 KB
Convex geometries are closure spaces which satisfy anti-exchange property, and they are known as dual of antimatroids. We consider functions deΓΏned on the sets of the extreme points of a convex geometry. Faigle-Kern (Math. Programming 72 (1996) 195-206) presented a greedy algorithm to linear program
A greedy reduction algorithm for setup o
β
Ulrich Faigle; Rainer Schrader
π
Article
π
1992
π
Elsevier Science
π
English
β 533 KB