Iterative algorithms for finding approximate solutions for general strongly nonlinear variational inequalities (Q1340556): Difference between revisions

Let \(K\) be a closed convex set in a Hilbert space \(H\) and \(T\), \(A\), \(g: H\to H\) be nonlinear operators. The problem of finding \(u\in H\) such that \(g(u)\in K\) and \[ \langle Tu, v- g(u)\rangle\geq \langle A(u), v- g(u)\rangle,\quad\text{for all } v\in K,\tag{1} \] is called the general strongly nonlinear variational inequality problem. If the convex set \(K\) also depends implicitly or explicitly on the solution \(u\), then the problem (1) is known as the general strongly nonlinear quasi-variational inequality problem. Essentially using the technique of \textit{M. A. Noor} [J. Math. Anal. Appl. 158, No. 2, 448-455 (1991; Zbl 0733.65047)], the author has considered the convergence analysis of some iterative algorithms for variational inequalities (1). It is worth mentioning that the assumption \(\text{Re}\langle m(u)- m(v), u- v- (g(u)- g(v))\rangle\leq \lambda\| u- v\|^ 2\), for all \(u, v\in H\) and for some constant \(\lambda\), is artificial and cannot be verified practically. Furthermore, by suitable and appropriate rearrangement of the inequalities, one can still prove the main results, that is, Theorem 3.1 and Theorem 3.2, without this assumption.