scholarly journals The Inertial Sub-Gradient Extra-Gradient Method for a Class of Pseudo-Monotone Equilibrium Problems

Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 463 ◽  
Author(s):  
Habib ur Rehman ◽  
Poom Kumam ◽  
Wiyada Kumam ◽  
Meshal Shutaywi ◽  
Wachirapong Jirakitpuwapat

In this article, we focus on improving the sub-gradient extra-gradient method to find a solution to the problems of pseudo-monotone equilibrium in a real Hilbert space. The weak convergence of our method is well-established based on the standard assumptions on a bifunction. We also present the application of our results that enable to solve numerically the pseudo-monotone and monotone variational inequality problems, in addition to the particular presumptions required by the operator. We have used various numerical examples to support our well-proved convergence results, and we can show that the proposed method involves a considerable influence over-running time and the total number of iterations.

2013 ◽  
Vol 2013 ◽  
pp. 1-9
Author(s):  
Abdul Latif ◽  
Mohammad Eslamian

Introducing a new iterative method, we study the existence of a common element of the set of solutions of equilibrium problems for a family of monotone, Lipschitz-type continuous mappings and the sets of fixed points of two nonexpansive semigroups in a real Hilbert space. We establish strong convergence theorems of the new iterative method for the solution of the variational inequality problem which is the optimality condition for the minimization problem. Our results improve and generalize the corresponding recent results of Anh (2012), Cianciaruso et al. (2010), and many others.


Axioms ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 127
Author(s):  
Wiyada Kumam ◽  
Kanikar Muangchoo

A number of applications from mathematical programmings, such as minimization problems, variational inequality problems and fixed point problems, can be written as equilibrium problems. Most of the schemes being used to solve this problem involve iterative methods, and for that reason, in this paper, we introduce a modified iterative method to solve equilibrium problems in real Hilbert space. This method can be seen as a modification of the paper titled “A new two-step proximal algorithm of solving the problem of equilibrium programming” by Lyashko et al. (Optimization and its applications in control and data sciences, Springer book pp. 315–325, 2016). A weak convergence result has been proven by considering the mild conditions on the cost bifunction. We have given the application of our results to solve variational inequality problems. A detailed numerical study on the Nash–Cournot electricity equilibrium model and other test problems is considered to verify the convergence result and its performance.


2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Zhuang Shan ◽  
Lijun Zhu ◽  
Long He ◽  
Danfeng Wu ◽  
Haicheng Wei

This paper focuses on the problem of variational inequalities with monotone operators in real Hilbert space. The Tseng algorithm constructed by Thong replaced a high-precision step. Thus, a new Tseng-like gradient method is constructed, and the convergence of the algorithm is proved, and the convergence performance is higher.


2012 ◽  
Vol 2012 ◽  
pp. 1-21 ◽  
Author(s):  
Rabian Wangkeeree ◽  
Pakkapon Preechasilp

We introduce the new iterative methods for finding a common solution set of monotone, Lipschitz-type continuous equilibrium problems and the set of fixed point of nonexpansive mappings which is a unique solution of some variational inequality. We prove the strong convergence theorems of such iterative scheme in a real Hilbert space. The main result extends various results existing in the current literature.


2018 ◽  
Vol 23 (3) ◽  
pp. 453-472 ◽  
Author(s):  
Pham Ngoc Anh ◽  
Dang Van Hieu

The paper introduces and analysizes the convergence of two multi-step proximal-like algorithms for pseudomonotone and Lipschitz-type continuous equilibrium problems in a real Hilbert space. The algorithms are combinations between the multi-step proximal-like method and Mann or Halpern iterations. The weakly and strongly convergent theorems are established with the prior knowledge of two Lipschitz-type continuous constants. Moreover, by choosing two sequences of suitable stepsizes, we also show that the multi-step proximal-like algorithm for strongly pseudomonotone and Lipschitz-type continuous equilibrium problems where the construction of solution approximations and the establishing of its convergence do not require the prior knowledge of strongly pseudomonotone and Lipschitz-type continuous constants of bifunctions. Finally, several numerical examples are reported to illustrate the convergence and the performance of the proposed algorithms over classical extragradient-like algorithms.


Symmetry ◽  
2019 ◽  
Vol 11 (4) ◽  
pp. 480
Author(s):  
Manatchanok Khonchaliew ◽  
Ali Farajzadeh ◽  
Narin Petrot

This paper presents two shrinking extragradient algorithms that can both find the solution sets of equilibrium problems for pseudomonotone bifunctions and find the sets of fixed points of quasi-nonexpansive mappings in a real Hilbert space. Under some constraint qualifications of the scalar sequences, these two new algorithms show strong convergence. Some numerical experiments are presented to demonstrate the new algorithms. Finally, the two introduced algorithms are compared with a standard, well-known algorithm.


Symmetry ◽  
2019 ◽  
Vol 11 (12) ◽  
pp. 1502
Author(s):  
Sun Young Cho

In a real Hilbert space, we investigate the Tseng’s extragradient algorithms with hybrid adaptive step-sizes for treating a Lipschitzian pseudomonotone variational inequality problem and a strict pseudocontraction fixed-point problem, which are symmetry. By imposing some appropriate weak assumptions on parameters, we obtain a norm solution of the problems, which solves a certain hierarchical variational inequality.


2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
F. O. Isiogugu ◽  
P. Pillay ◽  
P. U. Nwokoro

We establish the existence of a strong convergent selection of a modified Mann-Reich-Sabach iteration scheme for approximating the common elements of the set of fixed points F(T) of a multivalued (or single-valued) k-strictly pseudocontractive-type mapping T and the set of solutions EP(F) of an equilibrium problem for a bifunction F in a real Hilbert space H. This work is a continuation of the study on the computability and applicability of algorithms for approximating the solutions of equilibrium problems for bifunctions involving the construction of a sequence {Kn}n=1∞ of closed convex subsets of H from an arbitrary x0∈H and a sequence {xn}n=1∞ of the metric projections of x0 into Kn. The obtained result is a partial resolution of the controversy over the computability of such algorithms in the contemporary literature.


Sign in / Sign up

Export Citation Format

Share Document