Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters

DOI10.1080/00036819708840536zbMath0877.65033OpenAlexW1967630543MaRDI QIDQ4351445

Gilbert Crombez

Publication date: 16 December 1997

Published in: Applicable Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00036819708840536

zbMATH Keywords

Hilbert spacesuccessive approximationconvex feasibility problemparallel projection methodblock-iterative projection method

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Inner product spaces and their generalizations, Hilbert spaces (46C99)

Related Items (2)

PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS ⋮ Unnamed Item

Cites Work

• Convergence results for an accelerated nonlinear Cimmino algorithm
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• Weak and norm convergence of a parallel projection method in Hilbert spaces
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Decomposition through formalization in a product space
• Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
• The method of projections for finding the common point of convex sets

This page was built for publication: Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters