Convergence of a general iterative method for nonexpansive mappings in Hilbert spaces (Q1019817)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5559070
Language Label Description Also known as
default for all languages
No label defined
    English
    Convergence of a general iterative method for nonexpansive mappings in Hilbert spaces
    scientific article; zbMATH DE number 5559070

      Statements

      Convergence of a general iterative method for nonexpansive mappings in Hilbert spaces (English)
      0 references
      0 references
      0 references
      28 May 2009
      0 references
      The results obtained in this paper extend and improve results of many authors. To approximate a fixed point of a nonexpansive mapping \(T\) in Hilbert spaces, the authors introduce a composite iterative algorithm, defined by means of three relations and involving the nonexpansive mapping \(T\), a contraction \(f\) and a strongly linear bounded selfadjoint operator \(A\). Also, the iterative algorithm depends on four real sequences from the interval [0,1]. Under some assumptions, the strong convergence of the iterative schemes to a fixed point is proved, some variational inequalities are solved, and the optimality condition for minimization of a quadratic function over the set of the fixed points of the nonexpansive mapping is given. Many special cases of the iterative schemes are discussed. The proposed iterative algorithm is a modified Ishikawa algorithm [see \textit{S.\,Ishikawa}, Proc.\ Am.\ Math.\ Soc.\ 44, 147--150 (1974; Zbl 0286.47036)].
      0 references
      nonexpansive mappings
      0 references
      fixed pont
      0 references
      strong convergence
      0 references
      Hilbert space
      0 references
      modified Ishikawa iterative process
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references