The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings (Q2768033)

This paper presents a simple algorithmic solution to the variational inequality problem defined over the nonempty intersection of multiple fixed point sets of nonexpansive mappings in a real Hilbert space. The algorithmic solution is named the hybrid steepest descent method and generates a sequence strongly convergent to the solution of the problem. NEWLINENEWLINENEWLINEThe applicability of this method to the convexly constrained generalized pseudoinverse problem as well as to the convex feasibility problem is demonstrated by constructing nonexpansive mappings whose fixed point sets are the feasible sets of the problem.NEWLINENEWLINEFor the entire collection see [Zbl 0971.00058].