Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2019
DOI: 10.1186/s13660-019-2233-1
|View full text |Cite
|
Sign up to set email alerts
|

Weak convergence of explicit extragradient algorithms for solving equilibirum problems

Abstract: 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 se… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
28
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
9

Relationship

5
4

Authors

Journals

citations
Cited by 49 publications
(29 citation statements)
references
References 45 publications
(64 reference statements)
1
28
0
Order By: Relevance
“…From the expression (23), (25) and (29) implies that the sequences {u n }, {w n } and {v n } are bounded, and for each u * ∈ EP( f , C), the lim n→∞ u n − u * 2 , lim n→∞ v n − u * 2 , lim n→∞ w n − u * 2 exists. Next, we are going to prove that the sequence {u n } strongly converges to u * .…”
Section: Lemmamentioning
confidence: 99%
See 1 more Smart Citation
“…From the expression (23), (25) and (29) implies that the sequences {u n }, {w n } and {v n } are bounded, and for each u * ∈ EP( f , C), the lim n→∞ u n − u * 2 , lim n→∞ v n − u * 2 , lim n→∞ w n − u * 2 exists. Next, we are going to prove that the sequence {u n } strongly converges to u * .…”
Section: Lemmamentioning
confidence: 99%
“…Furthermore, Konnov [12] also provides a different variant of the proximal point method with weaker assumptions in the case of equilibrium problems. Several numerical methods based on these techniques have been developed to solve different classes of equilibrium problems in finite and infinite-dimensional abstract spaces (for more details see, [12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29]). More specifically, Hieu et al in [30] developed an iterative sequence sequence {u n } recursively as…”
Section: Introductionmentioning
confidence: 99%
“…The development of new iterative methods and the examination of their converging analysis are among the most effective and valuable research directions in equilibrium theory. Several numerical results for solving the problem of equilibrium in different abstract spaces have been established (for instance, see [12][13][14][15][16][17][18][19][20][21][22][23][24][25][26][27]).…”
Section: Introductionmentioning
confidence: 99%
“…The Variational Inequality (VI) problem Equation (1) is a fundamental problem in optimization theory which is applied in many areas of study, such as transportation problems, equilibrium, economics, engineering and so on (Refs. [1][2][3][4][5][6][7][8][9][10][11][12][13][14]). There are many approaches to the VI problem, the basic one being the regularization and projection method.…”
Section: Introductionmentioning
confidence: 99%