A computational role of partially relaxed monotone mappings in approximation solvability of nonlinear variational inequalities
Ram U. Verma · Mathematical Inequalities & Applications · 2002
A computational role of a class of partially relaxed monotone mappings in the approximation-solvability of a class of nonlinear variational inequalities based on a variational inequality type algorithm is presented. We consider a class of nonlinear variational inequality (abbreviated as NVI) problems: find an element x * K such that