scholarly journals An inertial extragradient method for solving bilevel equilibrium problems

2020 ◽  
Vol 36 (1) ◽  
pp. 91-107
Author(s):  
JIRAPRAPA MUNKONG ◽  
BUI VAN DINH ◽  
KASAMSUK UNGCHITTRAKOOL
Keyword(s):  
Hilbert Space ◽  
Numerical Experiment ◽  
Equilibrium Problems ◽  
Real Hilbert Space ◽  
Extragradient Method ◽  
Iteration Process ◽  
Iterative Sequence ◽  
Inertial Term ◽  
Speed Up ◽  
Bilevel Equilibrium Problems

In this paper, we propose an algorithm with two inertial term extrapolation steps for solving bilevel equilibrium problem in a real Hilbert space. The inertial term extrapolation step is introduced to speed up the rate of convergence of the iteration process. Under some sufficient assumptions on the bifunctions involving pseudomonotone and Lipschitz-type conditions, we obtain the strong convergence of the iterative sequence generated by the proposed algorithm. A numerical experiment is performed to illustrate the numerical behavior of the algorithm and also comparison with some other related algorithms in the literature.

scholarly journals Approximations of an Equilibrium Problem without Prior Knowledge of Lipschitz Constants in Hilbert Spaces with Applications

Axioms ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 76
Author(s):  
Chainarong Khanpanuk ◽  
Nuttapol Pakkaranang ◽  
Nopparat Wairojjana ◽  
Nattawut Pholasa
Keyword(s):  
Hilbert Space ◽  
Iterative Method ◽  
Hilbert Spaces ◽  
Equilibrium Problems ◽  
Iterative Scheme ◽  
Real Hilbert Space ◽  
Extragradient Method ◽  
Inertial Term ◽  
Mild Conditions ◽  
Lipschitz Constants

The objective of this paper is to introduce an iterative method with the addition of an inertial term to solve equilibrium problems in a real Hilbert space. The proposed iterative scheme is based on the Mann-type iterative scheme and the extragradient method. By imposing certain mild conditions on a bifunction, the corresponding theorem of strong convergence in real Hilbert space is well-established. The proposed method has the advantage of requiring no knowledge of Lipschitz-type constants. The applications of our results to solve particular classes of equilibrium problems is presented. Numerical results are established to validate the proposed method’s efficiency and to compare it to other methods in the literature.

scholarly journals Shrinking Extragradient Method for Pseudomonotone Equilibrium Problems and Quasi-Nonexpansive Mappings

Symmetry ◽  
2019 ◽  
Vol 11 (4) ◽  
pp. 480
Author(s):  
Manatchanok Khonchaliew ◽  
Ali Farajzadeh ◽  
Narin Petrot
Keyword(s):  
Hilbert Space ◽  
Strong Convergence ◽  
Numerical Experiments ◽  
Equilibrium Problems ◽  
Real Hilbert Space ◽  
Nonexpansive Mappings ◽  
Extragradient Method ◽  
Constraint Qualifications ◽  
Solution Sets ◽  
New Algorithms

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.

scholarly journals An Accelerated Extragradient Method for Solving Pseudomonotone Equilibrium Problems with Applications

Axioms ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 99 ◽  
Author(s):  
Nopparat Wairojjana ◽  
Habib ur Rehman ◽  
Ioannis K. Argyros ◽  
Nuttapol Pakkaranang
Keyword(s):  
Hilbert Space ◽  
Weak Convergence ◽  
Numerical Solution ◽  
Convergence Theorem ◽  
Equilibrium Problems ◽  
Real Hilbert Space ◽  
Extragradient Method ◽  
Suggested Method ◽  
Experimental Results ◽  
Weak Convergence Theorem

Several methods have been put forward to solve equilibrium problems, in which the two-step extragradient method is very useful and significant. In this article, we propose a new extragradient-like method to evaluate the numerical solution of the pseudomonotone equilibrium in real Hilbert space. This method uses a non-monotonically stepsize technique based on local bifunction values and Lipschitz-type constants. Furthermore, we establish the weak convergence theorem for the suggested method and provide the applications of our results. Finally, several experimental results are reported to see the performance of the proposed method.

scholarly journals A Weak Convergence Self-Adaptive Method for Solving Pseudomonotone Equilibrium Problems in a Real Hilbert Space

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1165 ◽  
Author(s):  
Pasakorn Yordsorn ◽  
Poom Kumam ◽  
Habib ur Rehman ◽  
Abdulkarim Hassan Ibrahim
Keyword(s):  
Hilbert Space ◽  
Weak Convergence ◽  
Line Search ◽  
Equilibrium Problems ◽  
Real Hilbert Space ◽  
Extragradient Method ◽  
Adaptive Method ◽  
Type Condition ◽  
Computational Performance ◽  
Weak Convergence Theorem

In this paper, we presented a modification of the extragradient method to solve pseudomonotone equilibrium problems involving the Lipschitz-type condition in a real Hilbert space. The method uses an inertial effect and a formula for stepsize evaluation, that is updated for each iteration based on some previous iterations. The key advantage of the algorithm is that it is achieved without previous knowledge of the Lipschitz-type constants and also without any line search procedure. A weak convergence theorem for the proposed method is well established by assuming mild cost bifunction conditions. Many numerical experiments are presented to explain the computational performance of the method and to equate them with others.

scholarly journals Approximation Results for Equilibrium Problems Involving Strongly Pseudomonotone Bifunction in Real Hilbert Spaces

Axioms ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 137
Author(s):  
Wiyada Kumam ◽  
Kanikar Muangchoo
Keyword(s):  
Equilibrium Problems ◽  
Real Hilbert Space ◽  
Extragradient Method ◽  
Minimax Problems ◽  
Strong Convergence Theorem ◽  
Test Problems ◽  
Subgradient Extragradient Method ◽  
Step Size ◽  
Pseudomonotone Bifunction ◽  
Equilibrium Test

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.

scholarly journals On Computability and Applicability of Mann-Reich-Sabach-Type Algorithms for Approximating the Solutions of Equilibrium Problems in Hilbert Spaces

2018 ◽  
Vol 2018 ◽  
pp. 1-9
Author(s):  
F. O. Isiogugu ◽  
P. Pillay ◽  
P. U. Nwokoro
Keyword(s):  
Hilbert Space ◽  
Hilbert Spaces ◽  
Equilibrium Problems ◽  
Real Hilbert Space ◽  
Contemporary Literature ◽  
Iteration Scheme ◽  
Common Elements ◽  
Type Mapping ◽  
The Common ◽  
Selection Of

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