scientific article; zbMATH DE number 3905745
In order to find the fixed points of a nonlinear mapping \(G: D\subset R^ N\to R^ N\), where \(R^ N\) is n-dimensional real Euclidean space, if Picard's iteration \(x_{n+1}=Gx_ n\), \(n=1,2,...\), does not converge, we may use the convex combined iteration \(x_{n+1}=\omega_ nx_ n+(1-\omega_ n)Gx_ n,\quad n=1,2,...,\) where \(0<\omega_ n<1\). In certain cases, this iteration converges to the fixed point of the mapping G. In practice, one uses this iteration with errors \[ x_{n+1}=\omega_ nx_ n+(1-\omega_ n)Gx_ n+e_ n,\quad n=1,2,...\quad. \] But it seems that the convergence of this convex combined iteration with errors has not been discussed strictly. In this paper, the concept of pseudo-monotonic sequence is given, and two convergence theorems on the convex combined iteration with errors are proved. We note that the mappings G in the theorems are nonexpansive and \(Gx=b-Fx\), respectively, where F is a uniform monotonic mapping and satisfies a Lipschitz condition, and \(b\in R^ N\).
- Convergence of iterative sequences for strict pseudocontractions and inverse-strongly monotone mappings
- On a class of iterative procedures with monotone convergence*}
- scientific article; zbMATH DE number 5145453
- Sequence convergence of inexact nonconvex and nonsmooth algorithms with more realistic assumptions
- scientific article; zbMATH DE number 5510425
- scientific article; zbMATH DE number 1932183
- Convergence of iterative algorithms for continuous pseudocontractive mappings
- Convergence of Iterative Methods for an Infinite Family of Pseudo-contractions
- Convergence theorems of iterative algorithms for continuous pseudocontractive mappings
- Monotonic sequences and rates of convergence of asynchronized iterative methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683429)