Weak and norm convergence of a parallel projection method in Hilbert spaces

DOI10.1016/0096-3003(93)90077-RzbMath0783.65049OpenAlexW2085974352MaRDI QIDQ2366626

Gilbert Crombez

Publication date: 30 August 1993

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

Full work available at URL: https://doi.org/10.1016/0096-3003(93)90077-r

zbMATH Keywords

Hilbert spacerelaxationnorm convergenceparallel projection methodcommon point of convex sets

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Parallel numerical computation (65Y05)

Related Items

A parallel projection method based on sequential most remote set in convex feasibility problems, Finding projections onto the intersection of convex sets in hilbert spaces, Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters, Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems

Cites Work

• Strong convergence of projection-like methods in Hilbert spaces
• Image recovery by convex combinations of projections
• Parallel methods in image recovery by projections onto convex sets
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Decomposition through formalization in a product space
• The method of projections for finding the common point of convex sets