Abstract

In this paper, we introduce inertial Tseng’s extragradient algorithms combined with normal-S iteration process for solving variational inequality problems involving pseudo-monotone and Lipschitz continuous operators. Under mild conditions, we establish the weak convergence results in Hilbert spaces. Numerical examples are also presented to show that faster behaviour of the proposed method.

Highlights

  • Variational inequality problems are extremely powerful tools to study the many nonlinear problems arising in several branches of applied science in different framework due to its successful applications in fields including control theory, game theory, transportation science, economic equilibrium and engineering sciences

  • It is worth mentioning that the variational inequality problem is a central problem in optimization theory

  • We focus on projection methods for solving the variational inequality problems, introduced by Goldstein [10] and defined by x1 ∈ C, xn = PC for all n ∈ N, (1.2)

Read more

Summary

Introduction

Variational inequality problems are extremely powerful tools to study the many nonlinear problems arising in several branches of applied science in different framework due to its successful applications in fields including control theory, game theory, transportation science, economic equilibrium and engineering sciences. Authors in [12,17,18,19,22] studied the convergence behaviour of projection methods and its variants for strongly pseudo-monotone and Lipschitzian variational inequality problems. The weak convergence of Tseng’s extragradient method for solving monotone Lipschitz continuous variational inequalities was established in [36], with a different choice of parameters, Thong and Hieu [34] established the strong convergence results for strongly pseudomonotone variational inequalities. In this article, motivated by the work of Tseng’s [36] and Sahu [24], we consider the variational inequality problem in Hilbert spaces and proposed an inertial normal S-type Tseng’s extragradient Algorithm for solution of variational inequality problems.

Preliminaries
Main results
Numerical experiments
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.