Alternated inertial subgradient extragradient method for equilibrium problems

Top ◽  
2021 ◽  
Author(s):  
Yekini Shehu ◽  
Qiao-Li Dong ◽  
Lulu Liu ◽  
Jen-Chih Yao
Axioms ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 137
Author(s):  
Wiyada Kumam ◽  
Kanikar Muangchoo

A plethora of applications in non-linear analysis, including minimax problems, mathematical programming, the fixed-point problems, saddle-point problems, penalization and complementary problems, may be framed as a problem of equilibrium. Most of the methods used to solve equilibrium problems involve iterative methods, which is why the aim of this article is to establish a new iterative method by incorporating an inertial term with a subgradient extragradient method to solve the problem of equilibrium, which includes a bifunction that is strongly pseudomonotone and meets the Lipschitz-type condition in a real Hilbert space. Under certain mild conditions, a strong convergence theorem is proved, and a required sequence is generated without the information of the Lipschitz-type cost bifunction constants. Thus, the method operates with the help of a slow-converging step size sequence. In numerical analysis, we consider various equilibrium test problems to validate our proposed results.


Energies ◽  
2020 ◽  
Vol 13 (12) ◽  
pp. 3292 ◽  
Author(s):  
Habib ur Rehman ◽  
Poom Kumam ◽  
Meshal Shutaywi ◽  
Nasser Aedh Alreshidi ◽  
Wiyada Kumam

This manuscript aims to incorporate an inertial scheme with Popov’s subgradient extragradient method to solve equilibrium problems that involve two different classes of bifunction. The novelty of our paper is that methods can also be used to solve problems in many fields, such as economics, mathematical finance, image reconstruction, transport, elasticity, networking, and optimization. We have established a weak convergence result based on the assumption of the pseudomonotone property and a certain Lipschitz-type cost bifunctional condition. The stepsize, in this case, depends upon on the Lipschitz-type constants and the extrapolation factor. The bifunction is strongly pseudomonotone in the second method, but stepsize does not depend on the strongly pseudomonotone and Lipschitz-type constants. In contrast, the first convergence result, we set up strong convergence with the use of a variable stepsize sequence, which is decreasing and non-summable. As the application, the variational inequality problems that involve pseudomonotone and strongly pseudomonotone operator are considered. Finally, two well-known Nash–Cournot equilibrium models for the numerical experiment are reviewed to examine our convergence results and show the competitive advantage of our suggested methods.


Author(s):  
Lateef Olakunle Jolaoso ◽  
Yekini Shehu ◽  
Regina N. Nwokoye

Abstract The subgradient extragradient method with inertial extrapolation step x n + θ n (x n − x n−1) (also known as inertial subgradient extragradient method) has been studied extensively in the literature for solving variational inequalities and equilibrium problems. Most of the inertial subgradient extragradient methods in the literature for both variational inequalities and equilibrium problems have not considered the special case when the inertial factor θ n = 1. The convergence results have always been obtained when the inertial factor θ n is assumed 0 ≤ θ n < 1. This paper considers the relaxed inertial version of subgradient extragradient method for equilibrium problems with 0 ≤ θ n ≤ 1. We give both weak and strong convergence results using this inertial subgradient extragradient method and also give some numerical illustrations.


Optimization ◽  
2019 ◽  
Vol 69 (4) ◽  
pp. 901-923 ◽  
Author(s):  
Vahid Dadashi ◽  
Olaniyi S. Iyiola ◽  
Yekini Shehu

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 216
Author(s):  
Annel Thembinkosi Bokodisa ◽  
Lateef Olakunle Jolaoso ◽  
Maggie Aphane

We introduce a new parallel hybrid subgradient extragradient method for solving the system of the pseudomonotone equilibrium problem and common fixed point problem in real reflexive Banach spaces. The algorithm is designed such that its convergence does not require prior estimation of the Lipschitz-like constants of the finite bifunctions underlying the equilibrium problems. Moreover, a strong convergence result is proven without imposing strong conditions on the control sequences. We further provide some numerical experiments to illustrate the performance of the proposed algorithm and compare with some existing methods.


Sign in / Sign up

Export Citation Format

Share Document