Analysis of two versions of relaxed inertial algorithms with Bregman divergences for solving variational inequalities

• Published in: Computational & applied mathematics Vol. 41; no. 7
• Main Authors: Jolaoso, Lateef Olakunle, Sunthrayuth, Pongsakorn, Cholamjiak, Prasit, Cho, Yeol Je
• Format: Journal Article
• Language: English
• Published: Cham Springer International Publishing 01.10.2022; Springer Nature B.V
• Subjects: Algorithms; Applications of Mathematics; Applied physics; Computational mathematics; Computational Mathematics and Numerical Analysis; Divergence; Hilbert space; Iterative methods; Mathematical analysis; Mathematical Applications in Computer Science; Mathematical Applications in the Physical Sciences; Mathematics; Mathematics and Statistics; Strong convergence; 47H10; Bregman divergence; Variational inequality problem; 47H09; Hilbert space; 47J05; 47J25; Pseudomonotone mapping
• ISSN: 2238-3603; 1807-0302
• DOI: 10.1007/s40314-022-02006-x

In this paper, we introduce and analyze two new inertial-like algorithms with the Bregman divergences for solving the pseudomonotone variational inequality problem in a real Hilbert space. The first algorithm is inspired by the Halpern-type iteration and the subgradient extragradient method and the second algorithm is inspired by the Halpern-type iteration and Tseng’s extragradient method. Under suitable conditions, we prove some strong convergence theorems of the proposed algorithms without assuming the Lipschitz continuity and the sequential weak continuity of the given mapping. Finally, we give some numerical experiments with various types of Bregman divergence to illustrate the main results. In fact, the results presented in this paper improve and generalize the related works in the literature.