• 제목/요약/키워드: quasi-nonexpansive mapping

검색결과 25건 처리시간 0.018초

HYBRID MONOTONE PROJECTION ALGORITHMS FOR ASYMPTOTICALLY QUASI-PSEUDOCONTRACTIVE MAPPINGS

  • Wu, Changqun;Cho, Sun-Young
    • East Asian mathematical journal
    • /
    • 제25권4호
    • /
    • pp.415-423
    • /
    • 2009
  • In this paper, we consider the hybrid monotone projection algorithm for asymptotically quasi-pseudocontractive mappings. A strong convergence theorem is established in the framework of Hilbert spaces. Our results mainly improve the corresponding results announced by [H. Zhou, Demiclosedness principle with applications for asymptotically pseudo-contractions in Hilbert spaces, Nonlinear Anal. 70 (2009) 3140-3145] and also include Kim and Xu [T.H. Kim, H.K. Xu, Strong convergence of modified Mann iterations for asymptotically nonexpansive mappings and semigroups, Nonlinear Anal. 64 (2006) 1140-1152; Convergence of the modified Mann's iteration method for asymptotically strict pseudo-contractions, Nonlinear Anal. 68 (2008) 2828-2836] as special cases.

CONVERGENCE OF MODIFIED VISCOSITY INEXACT MANN ITERATION FOR A FAMILY OF NONLINEAR MAPPINGS FOR VARIATIONAL INEQUALITY IN CAT(0) SPACES

  • Kyung Soo Kim
    • Nonlinear Functional Analysis and Applications
    • /
    • 제28권4호
    • /
    • pp.1127-1143
    • /
    • 2023
  • The purpose of this paper, we prove convergence theorems of the modified viscosity inexact Mann iteration process for a family of asymptotically quasi-nonexpansive type mappings in CAT(0) spaces. We also show that the limit of the modified viscosity inexact Mann iteration {xn} solves the solution of some variational inequality.

STRONG CONVERGENCE FOR THREE CLASSES OF UNIFORMLY EQUI-CONTINUOUS AND ASYMPTOTICALLY QUASI-NONEXPANSIVE MAPPINGS

  • Qin, Xiaolong;Su, Yongfu;Shang, Meijuan
    • 대한수학회지
    • /
    • 제45권1호
    • /
    • pp.29-40
    • /
    • 2008
  • In this paper, we introduce a modified three-step iteration scheme with errors for three classes of uniformly equi-continuous and asymptotically quasi-nonexpansive mappings in the framework of uniformly convex Banach spaces. We then use this scheme to approximate a common fixed point of these mappings. The results obtained in this paper extend and improve the recent ones announced by Khan, Fukhar-ud-di, Zhou, Cho, Noor and some others.

OUTER APPROXIMATION METHOD FOR ZEROS OF SUM OF MONOTONE OPERATORS AND FIXED POINT PROBLEMS IN BANACH SPACES

  • Abass, Hammad Anuoluwapo;Mebawondu, Akindele Adebayo;Narain, Ojen Kumar;Kim, Jong Kyu
    • Nonlinear Functional Analysis and Applications
    • /
    • 제26권3호
    • /
    • pp.451-474
    • /
    • 2021
  • In this paper, we investigate a hybrid algorithm for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators which is also a common fixed point problem for finite family of relatively quasi-nonexpansive mappings and split feasibility problem in uniformly convex real Banach spaces which are also uniformly smooth. The iterative algorithm employed in this paper is design in such a way that it does not require prior knowledge of operator norm. We prove a strong convergence result for approximating the solutions of the aforementioned problems and give applications of our main result to minimization problem and convexly constrained linear inverse problem.

Strong Convergence of a Bregman Projection Method for the Solution of Pseudomonotone Equilibrium Problems in Banach Spaces

  • Olawale Kazeem Oyewole;Lateef Olakunle Jolaoso;Kazeem Olalekan Aremu
    • Kyungpook Mathematical Journal
    • /
    • 제64권1호
    • /
    • pp.69-94
    • /
    • 2024
  • In this paper, we introduce an inertial self-adaptive projection method using Bregman distance techniques for solving pseudomonotone equilibrium problems in reflexive Banach spaces. The algorithm requires only one projection onto the feasible set without any Lipschitz-like condition on the bifunction. Using this method, a strong convergence theorem is proved under some mild conditions. Furthermore, we include numerical experiments to illustrate the behaviour of the new algorithm with respect to the Bregman function and other algorithms in the literature.