Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 71, 2022 - Issue 13
207
Views
1
CrossRef citations to date
0
Altmetric
Research Article

Inertial modified projection algorithm with self-adaptive technique for solving pseudo-monotone variational inequality problems in Hilbert spaces

ORCID Icon &
Pages 3965-3980 | Received 22 Aug 2020, Accepted 16 Apr 2021, Published online: 21 May 2021

References

  • Xiu NH, Zhang JZ. Some recent advances in projection-type methods for variational inequalities. J Comput Appl Math. 2003;152:559–587.
  • Xu HK. Averaged mappings and the gradient-projection algorithm. J Optim Theory Appl. 2011;150:360–378.
  • Ceng LC, Ansari QH, Yao JC. Relaxed extragradient methods for finding minimum-norm solution of the split feasibility problem. Nonlin Anal. 2012;75:2116–2125.
  • Tuyen TM. A cyclic iterative method for solving a class of variational inequalitys in Hilbert spaces. Optimization. 2018;67:969–1976.
  • Xu HK. Iterative algorithm for nonlinear operators. J Lond Math Soc. 2002;66(2):240–256.
  • Koepelevich GM. The extragradient method for finding saddle points and other problem. Ekon Mat Metody. 1976;12:747–756.
  • Tseng P. A modified forward-backward splitting method for maximal monotone mappings. SIAM J Control Optim. 2000;38:431–446.
  • Censor Y, Gibali A, Reich S. The subgradient extragradient method for solving variational inequalities in Hilbert space. J Optim Theory Appl. 2011;148:318–335.
  • Gibali A, Hieu DV. A new inertial double-projection method for solving variational inequalities. J Fixed Point Theory Appl. 2019;21:97. 10.1007/s11784-019-0726-7.
  • Hanjing A, Suantai S. Hybrid inertial accelerated algorithms for split fixed point problems of demicontractive mappings and equilibrium problems. Numer Algorithms. 2020;85:1051–1073. 10.1007/s11075-019-00855-y.
  • Gibali A, Nguyen TV. Gradient projection-type algorithms for solving equilibrium problems and its applications. Comput Math Appl. 2019;38:119. 10.1007/s40314-019-0894-5.
  • Liu LY, Qin X. On the strong convergence of a projection-based algorithm in Hilbert spaces. J Appl Anal Comput. 2020;10(1):104–117.
  • Hieu DV, Cho YJ, Xiao YB. Modified accelerated algorithms for solving variational inequalities. Int J Comput Math. 2019;2233–2258. DOI:10.1080/00207160.2019.1686487.
  • Alvarez F, Attouch H. An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal. 2001;9:3–11.
  • Thong DV, Hieu DV. Weak and strong convergence theorems for variational inequality problems. Numer Algorithms. 2017;78:1045–1060.
  • Censor Y, Gibali A, Reich S. Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space. Optim Methods Softw. 2011;26:827–845.
  • Qin X, Petrusel A, Yao JC. CQ iterative algorithms for fixed points of nonexpansive mappings and split feasibility problems in Hilbert spaces. J Nonlin Convex Anal. 2018;19:157–165.
  • Nadezhkina N, Takahashi W. Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings. J Optim Theory Appl. 2006;128:191–201.
  • Hu X, Wang J. Solving pseudomonotone variational inequalities and pseudoconver optimization problems using the projection neural network. IEEE Trans Neural Netw. 2006;17:1487–1499.
  • Takahashi W. Introduction to nonlinear and convex analysis. Yokohoma: Yokohoma Publishers; 2009.
  • Mainge PE. The viscosity approximation process for quasi-nonexpansive mapping in Hilbert space. Comput Math Appl. 2010;59:74–79.
  • Goebel K, Reich S. Uniform convexity, hyperbolic geometry, and nonexpansive mappings. New York: Marcel Dekker; 1984.
  • Cottle RW, Yao JC. Pseudo-monotone complementarity problems in Hilbert space. J Optim Theory Appl. 1992;75:281–295.
  • Barbu V. Nonlinear semigroups and differential equations inBanach spaces. Amsterdam: Noordhoff; 1976.
  • Yang J, Liu HW. Strong convergence result for solving monotone variational inequalities in Hilbert space. Numer Algorithms. 2019;80:741–752.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.