2012
DOI: 10.1134/s0005117912040030
|View full text |Cite
|
Sign up to set email alerts
|

Comparative analysis of the extragradient methods for solution of the variational inequalities of some problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
6
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 3 publications
0
6
0
Order By: Relevance
“…The convergence without problem modification is provided in iterative extragradient methods first proposed by Korpelevich in [21]. These methods were analyzed in many studies [22][23][24][25][26][27][28][29][30][31][32][33][34]. For variational inequalities and equilibrium programming problems, modifications of the Korpelevich algorithm with one metric projection onto feasible set were proposed [27,28].…”
Section: Introductionmentioning
confidence: 99%
“…The convergence without problem modification is provided in iterative extragradient methods first proposed by Korpelevich in [21]. These methods were analyzed in many studies [22][23][24][25][26][27][28][29][30][31][32][33][34]. For variational inequalities and equilibrium programming problems, modifications of the Korpelevich algorithm with one metric projection onto feasible set were proposed [27,28].…”
Section: Introductionmentioning
confidence: 99%
“…A convergence theorem is given without proof and computational results are presented to show the efficiency of the two-step extragradient method for solving linear programming problems with filled (without zeroes) matrices of dimension 10 to 50. The proof of convergence appeared in 2012 with some other numerical examples in [20]. In that paper, the authors proved that the distance between the iterate x k and the solution x * is sufficiently decreasing at each iteration.…”
mentioning
confidence: 96%
“…Notice that when α k = 0, the vectors xk and x k coincide and the corresponding iteration becomes the classical extragradient iteration. On the other hand, when α k = β k = β > 0, the iteration corresponds to the two-step extragradient iteration [20]. The aim of the paper is twofold.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…From theorem in [14] about the convergence with respect to the norm of two-step extragradient method (2) for variational inequalities we obtain…”
mentioning
confidence: 99%