Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems

From MaRDI portal
Publication:2043907

DOI10.1007/S43036-021-00155-0zbMATH Open1494.47116arXiv2006.16615OpenAlexW3038570815MaRDI QIDQ2043907FDOQ2043907

Jingjing Fan, Xiaolong Qin, Bing Tan

Publication date: 3 August 2021

Published in: Advances in Operator Theory (Search for Journal in Brave)

Abstract: The objective of this research is to explore a convex feasibility problem, which consists of a monotone variational inequality problem and a fixed point problem. We introduce four inertial extragradient algorithms that are motivated by the inertial method, the subgradient extragradient method, the Tseng's extragradient method and the Mann-type method endowed with a simple step size. Strong convergence theorems of the algorithms are established under some standard and suitable conditions enforced by the cost operators. Finally, we implement some computational tests to show the efficiency and advantages of the proposed algorithms and compare them with some existing ones.


Full work available at URL: https://arxiv.org/abs/2006.16615





Cites Work


Cited In (3)






This page was built for publication: Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043907)