Performance of the thresholding greedy algorithm with larger greedy sums
From MaRDI portal
Publication:2701290
DOI10.1016/j.jmaa.2023.127126OpenAlexW4321206936MaRDI QIDQ2701290
Publication date: 28 April 2023
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.00268
Normed linear spaces and Banach spaces; Banach lattices (46Bxx) Approximations and expansions (41Axx) Topological linear spaces and related structures (46Axx)
Cites Work
- Unnamed Item
- Renorming spaces with greedy bases
- Characterization of 1-almost greedy bases
- Greedy bases for Besov spaces
- Renormings and symmetry properties of 1-greedy bases
- Characterization of 1-greedy bases
- Characterization of 1-quasi-greedy bases
- The thresholding greedy algorithm, greedy bases, and duality
- Lebesgue inequalities for the greedy algorithm in general bases
- Greedy algorithm with gaps
- No greedy bases for matrix spaces with mixed \(\ell_p\) and \(\ell_q\) norms
- Strong partially greedy bases and Lebesgue-type inequalities
- Weight-partially greedy bases and weight-property \((A)\)
- The weighted property (A) and the greedy algorithm
- Characterizations of almost greedy and partially greedy bases
- A note on partially-greedy bases in quasi-Banach spaces
- On the existence of almost greedy bases in Banach spaces
- Greedy approximation for biorthogonal systems in quasi-Banach spaces
This page was built for publication: Performance of the thresholding greedy algorithm with larger greedy sums
