Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces (Q1615982): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964119647 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1707.07513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lorentz spaces and embeddings induced by almost greedy bases in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lebesgue inequalities for the greedy algorithm in general bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy bases are best for \(m\)-term approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments in the theory of Lorentz spaces and weighted inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of almost greedy bases in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The thresholding greedy algorithm, greedy bases, and duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lebesgue constants for the weak greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-greedy bases and Lebesgue-type inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conditional quasi-greedy basis of l<sub>1</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional analysis and infinite-dimensional geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lebesgue-type inequalities for quasi-greedy bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Democracy functions and optimal embeddings for approximation spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5290964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biorthogonal systems in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some curious bases for $c_{0}$ and C[0,1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4136031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms and best \(m\)-term approximation with respect to biorthogonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5640160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm and \(m\)-term trigonometric approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best \(m\)-term approximation and greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4233472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3104395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm for general biorthogonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4416672 / rank
 
Normal rank

Revision as of 03:56, 17 July 2024

scientific article
Language Label Description Also known as
English
Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces
scientific article

    Statements

    Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 October 2018
    0 references
    Let \(X\) be a separable Banach space (over \(\mathbb{K}=\mathbb{R}\) or \(\mathbb{C}\}\)) with dual \(X^*\) and \(\{e_n,e^*_n\}_{n=1}^\infty\) a biorthogonal system in \(X\times X^*\). One supposes that the system \(\{e_n,e^*_n\}_{n=1}^\infty\) is semi-normalized, i.e., there exist \(\alpha,\beta>0\) such that \(\alpha\leq \|e_n\|,\|e_n^*\|\leq \beta,\, \forall n\in\mathbb{N}\), and complete, i.e., the span of \(\{e_n\}_{n=1}^\infty\) is dense in \(X\). The \(N\)-term approximation and the expansional \(N\)-term approximation are defined by \[ \sigma_N(x):=\inf\big\{\big\|x-\sum_{n\in A}c_ne_n\big\| : c_n\in\mathbb{K},\, |A|\leq N\big\} \] and \[ \tilde\sigma_N(x):=\inf\big\{\big\|x-\sum_{n\in A}e^*_n(x)e_n\big\| : |A|\leq N\big\}\,, \] respectively. A greedy set of order \(N\) is a set \(A\subset \mathbb{N}\) with \(|A|=N\) and \(\min_{n\in A}|e^*_n(x)|\geq \max_{n\notin A}|e^*_n(x)|\). One denotes this by \(A\in\mathcal{G}(x,N)\). A greedy operator of order \(N\) is defined by \(G_Nx=\sum_{n\in A_x}e^*_n(x)e_n\,,\) for some \(A_x\in \mathcal{G}(x,N)\). One denotes by \(\mathcal{G}_N\) the set of all greedy operators of order \(N\). The smallest number \(L_N\) such that \[ \|x- G_Nx\|\leq L_N\sigma_N(x), \quad\text{for all }\;x\in X\quad\text{and }\;G_N\in\mathcal{G}_N,\leqno(\ast) \] is called the Lebesgue-type constant associated to the greedy algorithm and the inequality \((*)\) a Lebesgue-type inequality. A similar definition is given for \(\tilde L_N\) by replacing \(\sigma_N(x)\) with \(\tilde\sigma_N(x)\). The paper is concerned with evaluations for these Lebesgue-type constants. As the authors write in the abstract: ``The bounds are given only in terms of the upper democracy functions of the basis and its dual. We also show that these estimates are equivalent to embeddings between the given Banach space and certain discrete weighted Lorentz spaces. Finally, the asymptotic optimality of these inequalities is illustrated in various examples of not necessarily quasi-greedy bases.''
    0 references
    greedy basis
    0 references
    quasi-greedy basis
    0 references
    greedy algorithm
    0 references
    biorthogonal system
    0 references
    non-linear approximation
    0 references
    Lebesgue-type inequality
    0 references
    Lebesgue-type constant
    0 references
    discrete Lorentz space
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references