Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
Publication:4846044
DOI10.2307/2154839zbMath0846.46010OpenAlexW4243086034MaRDI QIDQ4846044
Publication date: 10 October 1996
Full work available at URL: https://doi.org/10.2307/2154839
convex feasibility problemblock-iterative projection methodintersection of a finite number of closed convex sets in a given Hilbert spaceone variable relaxation coefficientparallel projection method with variable weightssemi-alternating sequential projection method
Computing methodologies for image processing (68U10) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items (9)
Cites Work
- Strong convergence of projection-like methods in Hilbert spaces
- A parallel projection method based on sequential most remote set in 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
This page was built for publication: Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems