On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1)

DOI10.1016/j.jat.2008.08.017zbMath1177.41032OpenAlexW2008866390MaRDI QIDQ1040855

S. L. Gogyan

Publication date: 26 November 2009

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2008.08.017

zbMATH Keywords

convergencegreedy algorithmsquasi-greedy basis

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (7)

On the boundedness of threshold operators in \(L_1[0,1\) with respect to the Haar basis] ⋮ Weak thresholding greedy algorithms in Banach spaces ⋮ Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases ⋮ On a greedy algorithm in \(L^{1}(0, 1)\) with regard to subsystems of the Haar system and on \(\omega \)-quasigreedy bases ⋮ On the convergence of a weak greedy algorithm for the multivariate Haar basis ⋮ On the quasi-greedy constant of the Haar subsystems in \(L^1(0, 1)\) ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a conjecture of Huber concerning the convergence of projection pursuit regression
• The best \(m\)-term approximation and greedy algorithms
• On approximate \(\ell_1\) systems in Banach spaces
• On weak non-equivalence of wavelet–like systems in L₁
• Convergence of greedy approximation I. General systems
• Greedy algorithm for general biorthogonal systems

This page was built for publication: On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1)