Parallel synchronous algorithm for nonlinear fixed point problems (Q2368438)

The authors give a convergence result concerning a parallel synchronous algorithm for nonlinear fixed point problems \(F(x^*) = x^*\). Herewith, they extend a convergence result of Bahi for linear fixed point problems using nonexpansive linear mappings with respect to a weighted maximum norm. In fact, the step-wise update of the iterate is happening in a generalized but well controlled way. The authors introduce asynchronous algorithms but mainly refer to synchronous ones. A special case of this algorithm is applied to the proximal inverse operator of \(I + T\), where \(T\) is a multivalued maximal monotone operator. Special cases of this algorithm consist in the Jacobi and Gauss-Seidel algorithms. Finally, the authors apply their convergence result to some problems related with convex analysis, such as minimization of functionals, calculus of saddle points, convex programming, and variational inequalities.