The projected subgradient algorithms can be considered as an improvement of the projected algorithms and the subgradient algorithms for the equilibrium problems of the class of monotone and Lipschitz continuous operators. In this paper, we present and analyze an iterative algorithm for finding a common element of the fixed point of pseudocontractive operators and the pseudomonotone equilibrium problem in Hilbert spaces. The suggested iterative algorithm is based on the projected method and subgradient method with a linearsearch technique. We show the strong convergence result for the iterative sequence generated by this algorithm. Some applications are also included. Our result improves and extends some existing results in the literature. [ABSTRACT FROM AUTHOR]
In this paper, we are interested in the pseudomonotone variational inequalities and fixed point problem of pseudocontractive operators in Hilbert spaces. An iterative algorithm has been constructed for finding a common solution of the pseudomonotone variational inequalities and fixed point of pseudocontractive operators. Strong convergence analysis of the proposed procedure is given. Several related corollaries are included. [ABSTRACT FROM AUTHOR]
*HILBERT space, *ALGORITHMS, *POINT set theory, *NONEXPANSIVE mappings
Abstract
In this paper, based on the Yamada iteration, we propose an iteration algorithm to find a common element of the set of fixed points of a nonexpansive mapping and the set of zeros of an inverse strongly-monotone mapping. We obtain a weak convergence theorem in Hilbert space. In particular, the set of zero points of an inverse strongly-monotone mapping can be transformed into the solution set of the variational inequality problem. Further, based on this result, we also obtain some new weak convergence theorems which are used to solve the equilibrium problem and the split feasibility problem. [ABSTRACT FROM AUTHOR]