Modified extragradient-like algorithms with new stepsizes for variational inequalities
- 48 Downloads
The paper concerns with an algorithm for approximating solutions of a variational inequality problem involving a Lipschitz continuous and monotone operator in a Hilbert space. The algorithm uses a new stepsize rule which does not depend on the Lipschitz constant and without any linesearch procedure. The resulting algorithm only requires to compute a projection on feasible set and a value of operator over each iteration. The convergence and the convergence rate of the algorithm are established. Some experiments are performed to show the numerical behavior of the proposed algorithm and also to compare its performance with those of others.
KeywordsVariational inequality Monotone operator Extragradient method Subgradient extragradient method Projection method
Mathematics Subject Classification65Y05 65K15 68W10 47H05 47H10
The authors would like to thank the Associate Editor and two anonymous referees for their valuable comments and suggestions which helped us very much in improving the original version of this paper. The first and third-named authors are supported by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under the project: 101.01-2017.315.
- 1.Antipin, A.S.: On a method for convex programs using a symmetrical modification of the Lagrange function. Ekon. Mat. Metody 12, 1164–1173 (1976)Google Scholar
- 22.Malitsky, Y.: Golden Ratio Algorithms for Variational Inequalities (2018). arXiv:1803.08832
- 31.Vuong, P.T., Shehu, Y.: Convergence of an extragradient-type method for variational inequality with applications to optimal control problems. Numer. Algor. (2018). https://doi.org/10.1007/s11075-018-0547-6