In this paper, we investigate two Mann-type accelerated projection procedures with line search method for solving the pseudomonotone variational inequality (VIP) and the common fixed-point problem (CFPP) of finitely many Bregman relatively nonexpansive mappings and a Bregman relatively asymptotically nonexpansive mapping in $ p $-uniformly convex and uniformly smooth Banach spaces. Under mild conditions, we show weak and strong convergence of the proposed algorithms to a common solution of the VIP and CFPP, respectively.
In this paper, we introduce the modified Mann-like subgradient-like extragradient implicit rules with linear-search process for finding a common solution of a system of generalized equilibrium problems, a pseudomonotone variational inequality problem and a fixed-point problem of an asymptotically nonexpansive mapping in a real Hilbert space. The proposed algorithms are based on the subgradient extragradient rule with linear-search process, Mann implicit iteration approach, and hybrid deepest-descent technique. Under mild restrictions, we demonstrate the strong convergence of the proposed algorithms to a common solution of the investigated problems, which is a unique solution of a certain hierarchical variational inequality defined on their common solution set.
In this paper, we continue to investigate the convergence analysis of Tseng-type forward-backward-forward algorithms for solving quasimonotone variational inequalities in Hilbert spaces. We use a self-adaptive technique to update the step sizes without prior knowledge of the Lipschitz constant of quasimonotone operators. Furthermore, we weaken the sequential weak continuity of quasimonotone operators to a weaker condition. Under some mild assumptions, we prove that Tseng-type forward-backward-forward algorithm converges weakly to a solution of quasimonotone variational inequalities.
In this research, we studied modified inertial composite subgradient extragradient implicit rules for finding solutions of a system of generalized equilibrium problems with a common fixed-point problem and pseudomonotone variational inequality constraints. The suggested methods consisted of an inertial iterative algorithm, a hybrid deepest-descent technique, and a subgradient extragradient method. We proved that the constructed algorithms converge to a solution of the considered problem, which also solved some hierarchical variational inequality.
In a real Banach space, let the VI indicate a variational inclusion for two accretive operators and let the CFPP denote a common fixed point problem of countably many nonexpansive mappings. In this article, we introduce a generalized extragradient implicit method for solving a general system of variational inequalities (GSVI) with the VI and CFPP constraints. Strong convergence of the suggested method to a solution of the GSVI with the VI and CFPP constraints under some suitable assumptions is established.
In this paper, we survey a common problem of the fixed point problem and the quasimonotone variational inequality problem in Hilbert spaces. We suggest an iterative algorithm for finding a common element of the solution of a quasimonotone variational inequality and the fixed point of a pseudocontractive operator. Convergence theorems are shown under some mild conditions. Several corollaries are also obtained.