2021
DOI: 10.1007/s13398-021-01116-1
|View full text |Cite
|
Sign up to set email alerts
|

An accelerated extragradient algorithm for bilevel pseudomonotone variational inequality problems with application to optimal control problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 38 publications
0
2
0
Order By: Relevance
“…Te authors established that under some appropriate assumptions, the sequence u n 􏼈 􏼉 generated by ( 16) converged strongly to unique solution of BVIP (1). Also, Tan et al [22] introduced and analyzed an accelerated projection and contraction extragradient algorithm for solving bilevel variational inequality problem (1). Tey proposed the iterative method:…”
Section: Introductionmentioning
confidence: 99%
“…Te authors established that under some appropriate assumptions, the sequence u n 􏼈 􏼉 generated by ( 16) converged strongly to unique solution of BVIP (1). Also, Tan et al [22] introduced and analyzed an accelerated projection and contraction extragradient algorithm for solving bilevel variational inequality problem (1). Tey proposed the iterative method:…”
Section: Introductionmentioning
confidence: 99%
“…where θ n ∈ [0, 1) is an extrapolation factor and λ n is a step-size parameter (sufficiently small) and ∇ F is the gradient of a smooth convex function F. The algorithm is more effective and converges faster is because of the term θ n (x n − x n−1 ) in (3) as the inertial step (see Alakoya et al [1], Ceng et al [5], Cholamjiak et al [12], Dong et al [13], Lorenz and Pock [30], Tan et al [44] and Thong et al [46]).…”
Section: Introductionmentioning
confidence: 99%