Analysis of Subgradient Extragradient Iterative Schemes for Variational Inequalities

In this paper, we investigate the monotone variational inequality in Hilbert spaces. Based on Censor’s subgradient extragradient method, we propose two modified subgradient extragradient algorithms with self-adaptive and inertial techniques for finding the solution of the monotone variational inequality in real Hilbert spaces. Strong convergence analysis of the proposed algorithms have been obtained under some mild conditions.

A self adaptive method for solving a class of bilevel variational inequalities with split variational inequality and composed fixed point problem constraints in Hilbert spaces

<p style='text-indent:20px;'>In this work, we propose a new inertial method for solving strongly monotone variational inequality problems over the solution set of a split variational inequality and composed fixed point problem in real Hilbert spaces. Our method uses stepsizes that are generated at each iteration by some simple computations, which allows it to be easily implemented without the prior knowledge of the operator norm as well as the Lipschitz constant of the operator. In addition, we prove that the proposed method converges strongly to a minimum-norm solution of the problem without using the conventional two cases approach. Furthermore, we present some numerical experiments to show the efficiency and applicability of our method in comparison with other methods in the literature. The results obtained in this paper extend, generalize and improve results in this direction.</p>

Two modifications of the inertial Tseng extragradient method with self-adaptive step size for solving monotone variational inequality problems

In this work, we introduce two new inertial-type algorithms for solving variational inequality problems (VIPs) with monotone and Lipschitz continuous mappings in real Hilbert spaces. The first algorithm requires the computation of only one projection onto the feasible set per iteration while the second algorithm needs the computation of only one projection onto a half-space, and prior knowledge of the Lipschitz constant of the monotone mapping is not required in proving the strong convergence theorems for the two algorithms. Under some mild assumptions, we prove strong convergence results for the proposed algorithms to a solution of a VIP. Finally, we provide some numerical experiments to illustrate the efficiency and advantages of the proposed algorithms.