PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS

DOI10.1081/NFA-120003670zbMath1004.65068OpenAlexW1965766551MaRDI QIDQ4546045

Gilbert Crombez

Publication date: 18 August 2002

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1081/nfa-120003670

zbMATH Keywords

parallel algorithmscommon fixed pointsparacontractions

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Parallel numerical computation (65Y05) Numerical solutions to equations with nonlinear operators (65J15)

Related Items (3)

Reflection-projection method for convex feasibility problems with an obtuse cone ⋮ A Geometrical Look at Iterative Methods for Operators with Fixed Points ⋮ A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence of sequential and asynchronous nonlinear paracontractions
• Incomplete projection algorithms for solving the convex feasibility problem
• Block-iterative surrogate projection methods for convex feasibility problems
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• Decomposition through formalization in a product space
• Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
• Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
• On Projection Algorithms for Solving Convex Feasibility Problems
• 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: PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS