Iterative methods for generalized variational inequalities

From MaRDI portal





The author proposes a three-step algorithm for solving the variational inequality \(u \in K\), \(\nu \in T(u)\), \(\langle \nu, v-u\rangle \geq 0\) for all \(v \in K\), where \(K\) is a non-empty convex closed set in a Hilbert space \(H\), and \(T\) is a possibly multivalued monotone mapping on \(H\). Assuming that \(T\) is partially relaxed strictly monotone and Lipschitz continuous with respect to the Hausdorff distance (so that the multivalued case is in fact tacitly excluded), it is shown that if the problem is solvable, then the algorithm converges to a solution.




Cited in
(29)








This page was built for publication: Iterative methods for generalized variational inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1861743)