Abstract
In this paper, we propose improved subgradient extragradient algorithms in terms of step sizes to solve pseudo-monotone variational inequalities in real Hilbert spaces. The first algorithm requires Lipschitz condition, but its improved step size procedure is given without prior estimate of the Lipschitz constant of the cost operator. The second algorithm with new and improved step sizes does not require Lipschitz condition of the cost operator and its convergence is proved without imposing additional summability conditions on the sequence defining the step size. Weak and norm convergence with Q-linear rate of convergence of the proposed methods are proved under mild conditions. Finally, we study the numerical behaviour of the proposed algorithms and give comparisons with some known methods in the literature.
Original language | English |
---|---|
Pages (from-to) | 1591-1614 |
Number of pages | 24 |
Journal | Journal of Nonlinear and Convex Analysis |
Volume | 22 |
Issue number | 8 |
Publication status | Published - 2021 |
Keywords
- Pseudo-monotone variational inequalities
- Subgradient extragradient algorithms
- linear convergence
- weak