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 o fthe 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.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.