Self adaptive inertial subgradient extragradient algorithms for solving pseudomonotone variational inequality problems
- 36 Downloads
In this paper, two new algorithms are introduced for solving a pseudomontone variational inequality problem with a Lipschitz condition in a Hilbert space. The algorithms are constructed around three methods: the subgradient extragradient method, the inertial method and the viscosity method. With a new stepsize rule is incorporated, the algorithms work without any information of Lipschitz constant of operator. The weak convergence of the first algorithm is established, while the second one is strongly convergent which comes from the viscosity method. In order to show the computational effectiveness of our algorithms, some numerical results are provided.
KeywordsSubgradient extragradient method Inertial method Variational inequality Pseudomonotone mapping Lipschitz continuity
The authors would like to thank anonymous reviewrs for their comments on the manuscript which helped us very much in improving and presenting the original version of this paper. This work is supported by Vietnam (National Foundation for Science and Technology Development (NAFOSTED)) under the project: 101.01-2019.320.
- 2.Antipin, A.S.: On a method for convex programs using a symmetrical modification of the Lagrange function. Ekonomika i Matematicheskie Metody 12, 1164–1173 (1976)Google Scholar
- 10.Cui, S., Shanbhag, U.V.: On the optimality of single projection variants of extragradient schemes for monotone stochastic variational inequality problems. arXiv:1904.11076v1
- 11.Cui, S., Shanbhag, U.V.: On the analysis of reflected gradient and splitting methods for monotone stochastic variational inequality problems. In: 55th IEEE Conference on Decision and Control, CDC 2016, Las Vegas, NV, USA, 12–14 December 2016, IEEE, pp. 4510–4515 (2016)Google Scholar