Lebesgue constants for the weak greedy algorithm

S. J. Dilworth, D. Kutzarova, T. Oikhberg

Research output: Contribution to journalArticlepeer-review


We estimate the Lebesgue constants for the weak thresholding greedy algorithm in a Banach space relative to a biorthogonal system. The estimates involve the weakness (relaxation) parameter of the algorithm, as well as properties of the basis, such as its quasi-greedy constant and democracy function.

Original languageEnglish (US)
Pages (from-to)393-409
Number of pages17
JournalRevista Matematica Complutense
Issue number2
StatePublished - May 1 2015


  • Biorthogonal system
  • Lebesgue constant
  • Markushevitch basis
  • Weak greedy algorithm

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Lebesgue constants for the weak greedy algorithm'. Together they form a unique fingerprint.

Cite this