Abstract
In this paper, using the concept of Bregman distance, we introduce a new Bregman subgradient extragradient method for solving equilibrium and common fixed point problems in a real reflexive Banach space. The algorithm is designed, such that the stepsize is chosen without prior knowledge of the Lipschitz constants. We also prove a strong convergence result for the sequence that is generated by our algorithm under mild conditions. We apply our result to solving variational inequality problems, and finally, we give some numerical examples to illustrate the efficiency and accuracy of the algorithm.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference55 articles.
1. From optimization and variational inequalities to equilibrium problems;Blum;Math. Stud.,1994
2. Combined Relaxation Methods for Variational Inequalities;Konnov,2000
3. Equilibrium Models and Variational Inequalities;Konnov,2007
4. Convergence of an adaptive penalty scheme for finding constrained equilibria
5. Nonlinear Programming Technique for Equilibria;Bigi,2019