Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces (Q2427283)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
scientific article

    Statements

    Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces (English)
    0 references
    0 references
    0 references
    8 May 2008
    0 references
    The authors establish some significant convergence theorems for two different block-iterative methods in order to solve the well known problem to identify the points in the intersection of fixed points sets from a finite class of nonexpansive mappings in Hilbert and finite dimensional Banach spaces.The paper is important for the adequate numerical methods in this field.
    0 references
    block-iterative algorithm
    0 references
    convex feasibility problem
    0 references
    nonexpansive mapping
    0 references
    relaxation method
    0 references

    Identifiers