Abstract
In this work, we introduce two Bregman projection algorithms with self-adaptive stepsize for solving pseudo-monotone variational inequality problem in a Hilbert space. The weak and strong convergence theorems are established without the prior knowledge of Lipschitz constant of the cost operator. The convergence behavior of the proposed algorithms with various functions of the Bregman distance are presented. More so, the performance and efficiency of our methods are compared to other related methods in the literature.
| Original language | English |
|---|---|
| Pages (from-to) | 1565-1589 |
| Number of pages | 25 |
| Journal | Journal of Applied Mathematics and Computing |
| Volume | 68 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Jun 2022 |
Keywords
- Bregman projection
- Hilbert space
- Pseudo-monotone mapping
- Strong convergence
- Variational inequality
Fingerprint
Dive into the research topics of 'New Bregman projection methods for solving pseudo-monotone variational inequality problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver