Photo by 16bitspixelz from unsplash
We study the approximation capability of the orthogonal super greedy algorithm (OSGA) with respect to μ-coherent dictionaries in Hilbert spaces. We establish the Lebesgue-type inequalities for OSGA, which show that… Click to show full abstract
We study the approximation capability of the orthogonal super greedy algorithm (OSGA) with respect to μ-coherent dictionaries in Hilbert spaces. We establish the Lebesgue-type inequalities for OSGA, which show that the OSGA provides an almost optimal approximation on the first [1/(18μs)] steps. Moreover, we improve the asymptotic constant in the Lebesgue-type inequality of OGA obtained by Livshitz E D.
Keywords:
orthogonal super;
super greedy;
greedy algorithm;
coherent dictionaries
Journal Title: Axioms
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Axioms
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!