tseng’s extragradient method
Recently Published Documents


TOTAL DOCUMENTS

7
(FIVE YEARS 6)

H-INDEX

2
(FIVE YEARS 1)

Author(s):  
Zhongbing Xie ◽  
Gang Cai ◽  
Xiaoxiao Li ◽  
Qiao-Li Dong

Abstract The purpose of this paper is to study a new Tseng’s extragradient method with two different stepsize rules for solving pseudomonotone variational inequalities in real Hilbert spaces. We prove a strong convergence theorem of the proposed algorithm under some suitable conditions imposed on the parameters. Moreover, we also give some numerical experiments to demonstrate the performance of our algorithm.


2021 ◽  
Author(s):  
Lateef Olakunle Jolaoso ◽  
Pongsakorn Sunthrayuth ◽  
Prasit Cholamjiak ◽  
Yeol Je Cho

Abstract It is well-known that the use of Bregman divergence is an elegant and effective technique for solving many problems in applied sciences. In this paper, we introduce and analyze two new inertial-like algorithms with Bregman divergence for solving pseudomonotone variational inequalities in a real Hilbert space. The first algorithm is inspired by Halpern -type iteration and subgradient extragradient method and the second algorithm is inspired by Halpern -type iteration and Tseng's extragradient method. Under suitable conditions, the strong convergence theorems of the algorithms are established without assuming the Lipschitz continuity and the sequential weak continuity of any mapping. Finally, several numerical experiments with various types of Bregman divergence are also performed to illustrate the theoretical analysis. The results presented in this paper improve and generalize the related works in the literature.


Axioms ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 248
Author(s):  
Godwin Amechi Okeke ◽  
Mujahid Abbas ◽  
Manuel De la Sen ◽  
Hira Iqbal

The aim of this paper is to propose a new iterative algorithm to approximate the solution for a variational inequality problem in real Hilbert spaces. A strong convergence result for the above problem is established under certain mild conditions. Our proposed method requires the computation of only one projection onto the feasible set in each iteration. Some numerical examples are presented to support that our proposed method performs better than some known comparable methods for solving variational inequality problems.


Sign in / Sign up

Export Citation Format

Share Document