Generalized approximate weak greedy algorithms (Q2577360)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Generalized approximate weak greedy algorithms
scientific article

    Statements

    Generalized approximate weak greedy algorithms (English)
    0 references
    0 references
    0 references
    19 December 2005
    0 references
    The authors discuss so-called ``generalized approximate weak greedy algorithms'' (gAWGAs) in a Hilbert space, which describe the process of greedy expansions involving errors in calculation of the coefficients in terms of their absolut values. The concepts of ``dictionary'' in a real Hilbert space with inner product and of the ``gAWGA-expansion of an element with respect to a dictionary'' are introduced. The authors give sufficient conditions on the parameters of gAWGAs, for convergence of gAWGA-expansion to the expanded element, with any dictionary. Also, they provide two counter-examples to show that the condition cannot be relaxed in general. For a class of dictionaries with more structure, a weakened necessary and sufficient condition for convergence of the gAWGA-expansion with respect to an orthonormal system are also proved.
    0 references
    pure greedy algorithms
    0 references
    matching pursuit
    0 references
    orthonormal system in Hilbert space
    0 references
    nonlinear approximation
    0 references
    dictionary
    0 references
    convergence
    0 references

    Identifiers