Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems

DOI10.2307/2154839zbMath0846.46010OpenAlexW4243086034MaRDI QIDQ4846044

Gilbert Crombez

Publication date: 10 October 1996

Full work available at URL: https://doi.org/10.2307/2154839

zbMATH Keywords

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

Mathematics Subject Classification ID

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

PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS, A parallel projection method based on sequential most remote set in convex feasibility problems, Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters, Solving stochastic convex feasibility problems in hilbert spaces, Iterative approaches to convex feasibility problems in Banach spaces, Extrapolation algorithm for affine-convex feasibility problems, A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets, Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces, Unnamed Item

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