Abstract
Herein, we present a new parallel extragradient method for solving systems of variational inequalities and common fixed point problems for demicontractive mappings in real Hilbert spaces. The algorithm determines the next iterate by computing a computationally inexpensive projection onto a sub-level set which is constructed using a convex combination of finite functions and an Armijo line-search procedure. A strong convergence result is proved without the need for the assumption of Lipschitz continuity on the cost operators of the variational inequalities. Finally, some numerical experiments are performed to illustrate the performance of the proposed method.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference42 articles.
1. Numerical Analysis of Variational Inequalities;Glowinski,1981
2. An Introduction to Variational Inequalities and Their Applications;Kinderlehrer,2000
3. Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
4. Finite-Dimensional Variational Inequalities and Complementary Problems;Facchinei,2003
5. A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献