Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems

DOI10.2307/2154839MaRDI QIDQ4846044zbMATH OpenOpenAlexFDO

Authors 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) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05)

Recommendations

• 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
• From parallel to sequential projection methods and vice versa in convex feasibility: Results and conjectures.
• An Adaptive Parallel Projection Method for Solving Convex Feasibility Problems
• Weak and norm convergence of a parallel projection method in Hilbert spaces

Cites work

• A parallel projection method based on sequential most remote set in convex feasibility problems
• Decomposition through formalization in a product space
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Strong convergence of projection-like methods in Hilbert spaces
• Weak and norm convergence of a parallel projection method in Hilbert spaces

Cited in

(14)

• A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets
• From parallel to sequential projection methods and vice versa in convex feasibility: Results and conjectures.
• Cases of ineffectiveness of geometric cuts in sequential projection methods
• Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces
• A parallel projection method based on sequential most remote set in convex feasibility problems
• Projection on the intersection of convex sets
• A successive projection method
• An Adaptive Parallel Projection Method for Solving Convex Feasibility Problems
• Iterative approaches to convex feasibility problems in Banach spaces
• Non-monotoneous parallel iteration for solving convex feasibility problems.
• Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
• Solving stochastic convex feasibility problems in hilbert spaces
• PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
• Extrapolation algorithm for affine-convex feasibility problems

This page was built for publication: Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4846044)