Robustness of Krasnoselski-Mann's algorithm for asymptotically nonexpansive mappings (Q642852)

From MaRDI portal
Revision as of 13:52, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Robustness of Krasnoselski-Mann's algorithm for asymptotically nonexpansive mappings
scientific article

    Statements

    Robustness of Krasnoselski-Mann's algorithm for asymptotically nonexpansive mappings (English)
    0 references
    0 references
    0 references
    27 October 2011
    0 references
    Summary: Iterative approximation of fixed points of nonexpansive mapping is a very active theme in many aspects of mathematical and engineering areas, in particular, in image recovery and signal processing. Because the errors usually occur in few places, it is necessary to show whether the iterative algorithm is robust or not. In the present work, we prove that Krasnoselski-Mann's algorithm is robust for asymptotically nonexpansive mapping in a Banach space setting. Our results generalize the corresponding results existing in the literature.
    0 references
    robustness
    0 references
    fixed point
    0 references
    nonexpansive mapping
    0 references
    iterative algorithm
    0 references
    Krasnoselski-Mann's algorithm
    0 references
    asymptotically nonexpansive mapping
    0 references
    Banach space
    0 references
    0 references
    0 references

    Identifiers

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