Strong convergence theorems for zeros of bounded maximal monotone nonlinear operators (Q417180)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Strong convergence theorems for zeros of bounded maximal monotone nonlinear operators
scientific article

    Statements

    Strong convergence theorems for zeros of bounded maximal monotone nonlinear operators (English)
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    Accretive mappings were introduced independently in 1967 by \textit{F. E. Browder} [Bull. Am. Math. Soc. 73, 875--882 (1967; Zbl 0176.45302)] and \textit{T. Kato} [J. Math. Soc. Japan 19, 508--520 (1967; Zbl 0163.38303)]. Interest in such mappings stems mainly from their firm connection with the existence theory for nonlinear evolution equations in real Banach spaces. An iteration process studied by \textit{C. E. Chidume} and \textit{H. Zegeye} [J. Math. Anal. Appl. 269, No.~2, 421--430 (2002; Zbl 1016.47045)] is proved to converge strongly to a solution of the equation \(Au = 0 \), where \(A\) is a bounded \(m\)-accretive operator on certain real Banach spaces \(E\) that include the \(L_{p}\) spaces, \(2\leq p<\infty\). The iteration process does not involve the computation of the resolvent at any step of the process and does not involve the projection of an initial vector onto the intersection of two convex subsets of \(E\), setbacks associated with the classical proximal point algorithm of \textit{B. Martinet} [Rev. Franç. Inform. Rech. Opér. 4, No. R-3, 154--158 (1970; Zbl 0215.21103)], \textit{R. T. Rockafellar} [SIAM J. Control Optim. 14, 877--898 (1976; Zbl 0358.90053)], and its modifications by various authors, for approximating of a solution of this equation. In this paper, the ideas of the iteration process are applied to approximate fixed points of uniformly continuous pseudocontractive maps.
    0 references
    monotone operators
    0 references
    \(m\)-accretive operator
    0 references
    fixed point theorems
    0 references
    iteration process
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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