Weak convergence of explicit extragradient algorithms for solving equilibirum problems
This paper aims to propose two new algorithms that are developed by implementing inertial and subgradient techniques to solve the problem of pseudomonotone equilibrium problems. The weak convergence of these algorithms is well established based on standard assumptions of a cost bi-function. The adva...
Saved in:
Published in | Journal of inequalities and applications Vol. 2019; no. 1; pp. 1 - 25 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Cham
Springer International Publishing
07.11.2019
Springer Nature B.V SpringerOpen |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper aims to propose two new algorithms that are developed by implementing inertial and subgradient techniques to solve the problem of pseudomonotone equilibrium problems. The weak convergence of these algorithms is well established based on standard assumptions of a cost bi-function. The advantage of these algorithms was that they did not need a line search procedure or any information on Lipschitz-type bifunction constants for step-size evaluation. A practical explanation for this is that they use a sequence of step-sizes that are updated at each iteration based on some previous iterations. For numerical examples, we discuss two well-known equilibrium models that assist our well-established convergence results, and we see that the suggested algorithm has a competitive advantage over time of execution and the number of iterations. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 1029-242X 1025-5834 1029-242X |
DOI: | 10.1186/s13660-019-2233-1 |