Search

We consider a new system of generalized variational inequalities (SGVI) defined on two closed convex subsets of a real Hilbert space. To find the solution of considered SGVI, a parallel Mann iteration process and a parallel S-iteration process have been proposed and the strong convergence of the sequences generated by these parallel iteration processes is discussed. Numerical example illustrates that the proposed parallel S-iteration process has an advantage over parallel Mann iteration process in computing altering points of some mappings. [ABSTRACT FROM AUTHOR]

In this paper, by combining a modified extragradient scheme with the viscosity approximation technique, an iterative scheme is developed for computing the common element of the set of fixed points of a sequence of asymptotically nonexpansive mappings and the set of solutions of the variational inequality problem for an α-inverse strongly monotone mapping. We prove a strong convergence theorem for the sequences generated by this scheme and give some applications of our convergence theorem. [ABSTRACT FROM AUTHOR]

We introduce an explicit iterative scheme for computing a common fixed point of a sequence of nearly nonexpansive mappings defined on a closed convex subset of a real Hilbert space which is also a solution of a variational inequality problem. We prove a strong convergence theorem for a sequence generated by the considered iterative scheme under suitable conditions. Our strong convergence theorem extends and improves several corresponding results in the context of nearly nonexpansive mappings. [ABSTRACT FROM AUTHOR]

The hybrid steepest-descent method introduced by Yamada (2001) is an algorithmic solution to the variational inequality problem over the fixed point set of nonlinear mapping and applicable to a broad range of convexly constrained nonlinear inverse problems in real Hilbert spaces. Lehdili and Moudafi (1996) introduced the new prox-Tikhonov regularization method for proximal point algorithm to generate a strongly convergent sequence and established a convergence property for it by using the technique of variational distance in Hilbert spaces. In this paper, motivated by Yamada's hybrid steepest-descent and Lehdili and Moudafi's algorithms, a generalized hybrid steepest-descent algorithm for computing the solutions of the variational inequality problem over the common fixed point set of sequence of nonexpansive-type mappings in the framework of Banach space is proposed. The strong convergence for the proposed algorithm to the solution is guaranteed under some assumptions. Our strong convergence theorems extend and improve certain corresponding results in the recent literature. [ABSTRACT FROM AUTHOR]