|
|
|
|
Strong convergence of inertial extragradient algorithms for solving variational inequalities and fixed point problems | |
![]() ![]() |
|
Fixed Point Theory, Volume 23, No. 2, 2022, 707-728, June 15th, 2022 DOI: 10.24193/fpt-ro.2022.2.17 Authors: B. Tan, L. Liu and X. Qin Abstract: This paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms need to calculate the projection on the feasible set only once in each iteration. Moreover, they can work well without the prior information of the Lipschitz constant of the operator and do not contain any linesearch process. Strong convergence theorems of the suggested algorithms are established under suitable conditions. Some experiments are presented to illustrate the numerical efficiency of the suggested algorithms and compare them with some existing ones. Key Words and Phrases: Variational inequality problem, fixed point problem, subgradient extragradient method, Tseng's extragradient method, inertial method, demicontractive mapping. 2010 Mathematics Subject Classification: 47H09, 47H10, 47J20, 65K15. Published on-line: June 15th, 2022.
Abstract pdf
Fulltext pdf
Back to volume's table of contents
|