Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces

DOI10.1016/0377-0427(92)00123-QzbMath0814.65053MaRDI QIDQ1343646

Dan Butnariu, Yair Censor

Publication date: 18 June 1995

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

strong convergenceweak convergenceHilbert spaceconvex feasibility problemblock-iterative projection method

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Related Items

A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ Block Iterative Methods for a Finite Family of Generalized Nonexpansive Mappings in Banach Spaces ⋮ Convergence of weighted averages of relaxed projections ⋮ Block iterative methods for a finite family of relatively nonexpansive mappings in Banach spaces ⋮ On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space ⋮ An estimate for Lipschitz constants of metric projections ⋮ Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods ⋮ A generalized block-iterative projection method for the common fixed point problem induced by cutters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxed outer projections, weighted averages and convex feasibility
• Method of successive projections for finding a common point of sets in metric spaces
• Strong convergence of projection-like methods in Hilbert spaces
• Error bounds for the method of alternating projections
• Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• On rings of operators. Reduction theory
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Decomposition through formalization in a product space