2013
DOI: 10.1007/s10898-013-0042-5
|View full text |Cite
|
Sign up to set email alerts
|

Modified projection method for strongly pseudomonotone variational inequalities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
44
0
1

Year Published

2015
2015
2022
2022

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 97 publications
(46 citation statements)
references
References 5 publications
1
44
0
1
Order By: Relevance
“…It is easily seen that r attains the minimum when λ = γ Q 2 . (ii) Corollary 1 is a generalization of the corresponding result for variational inequalities in [16].…”
Section: Algorithm 2 (One-projection Algorithm)mentioning
confidence: 79%
“…It is easily seen that r attains the minimum when λ = γ Q 2 . (ii) Corollary 1 is a generalization of the corresponding result for variational inequalities in [16].…”
Section: Algorithm 2 (One-projection Algorithm)mentioning
confidence: 79%
“…We only prove (4.14). For the proof of (4.13), see [4]. Since e n = γ n (F (x n+1 ) − F (x n )), it follows from (4.5) that…”
Section: 2mentioning
confidence: 99%
“…Interested readers may refer to some recent articles that propose algorithms with variable step sizes which are independent of factorials of the underlying operator and Lipschitz constant (Refs. [28][29][30][31]). The question now is, can we have an iterative scheme involving a more general class of operators with a strong convergence and self-adaptive step size?…”
Section: Introductionmentioning
confidence: 99%