Pages that link to "Item:Q2348348"
From MaRDI portal
The following pages link to Lebesgue constants for the weak greedy algorithm (Q2348348):
Displaying 16 items.
- Efficiency of weak greedy algorithms for \(m\)-term approximations (Q294506) (← links)
- Lebesgue constants for Chebyshev thresholding greedy algorithms (Q824549) (← links)
- Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces (Q1615982) (← links)
- Lebesgue inequalities for the greedy algorithm in general bases (Q1675683) (← links)
- Greedy algorithm with gaps (Q1685952) (← links)
- Equivalence between almost-greedy and semi-greedy bases (Q1799771) (← links)
- Quasi-greedy bases for sequences with gaps (Q2019394) (← links)
- Strong partially greedy bases and Lebesgue-type inequalities (Q2067508) (← links)
- Variations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithms (Q2104952) (← links)
- Lebesgue inequalities for Chebyshev thresholding greedy algorithms (Q2206762) (← links)
- Characterization of weight-semi-greedy bases (Q2291574) (← links)
- The weighted property (A) and the greedy algorithm (Q2334382) (← links)
- Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases (Q2688668) (← links)
- Extensions of democracy-like properties for sequences with gaps (Q5881607) (← links)
- Greedy-like bases for sequences with gaps (Q6124332) (← links)
- Linear versus nonlinear forms of partial unconditionality of bases (Q6592089) (← links)
