Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
Copyright policy )Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
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.
block-iterative algorithm, Block-iterative algorithmic scheme, Convex programming, Nonexpansive mapping, relaxation method, Applications of functional analysis in optimization, convex analysis, mathematical programming, economics, Applied Mathematics, Relaxation method, nonexpansive mapping, Common fixed point, convex feasibility problem, Analysis
block-iterative algorithm, Block-iterative algorithmic scheme, Convex programming, Nonexpansive mapping, relaxation method, Applications of functional analysis in optimization, convex analysis, mathematical programming, economics, Applied Mathematics, Relaxation method, nonexpansive mapping, Common fixed point, convex feasibility problem, Analysis
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).56 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!