Abstract
In this paper, we introduce a self-adaptive Bregman subgradient extragradient method for solving variational inequalities in the framework of a reflexive Banach space. The step-adaptive strategy avoids the difficult task of choosing a stepsize based on the Lipschitz constant of the cost function of the variational inequalities and improves the performance of the algorithm. Moreover, the use of the Bregman distance technique allows the consideration of a general feasible set for the problem. Under some suitable conditions, we prove some weak and strong convergence results for the sequence generated by the algorithm without prior knowledge of the Lipschitz constant. We further provide an application to contact problems and some numerical experiments to illustrate the performance of the algorithm.
Original language | English |
---|---|
Pages (from-to) | 3835-3860 |
Number of pages | 26 |
Journal | Optimization |
Volume | 71 |
Issue number | 13 |
DOIs | |
Publication status | Published - 2022 |
Keywords
- 47H09
- 49J25
- 65K10
- 90C25
- Bregman distance
- extragradient method
- pseudomonotone operators
- self-adaptive stepsize
- variational inequalities