2010 Third International Joint Conference on Computational Science and Optimization 2010
DOI: 10.1109/cso.2010.50
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of Convergence of the Modified and Relaxed Hybrid Steepest-Descent Methods for Variational Inequalities under Different Conditions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(10 citation statements)
references
References 12 publications
0
9
0
Order By: Relevance
“…First, we prove a strong convergence of the MRHSD method under different and suitable restrictions imposed on the parameters (Condition 3.2). The proof of strong convergence is different from the previous proof [20]. Second, based on the approximate projection contraction method, we design an efficient implementation of the MRHSD method for a type of variational inequality problem.…”
Section: It Is Known That Xmentioning
confidence: 90%
See 4 more Smart Citations
“…First, we prove a strong convergence of the MRHSD method under different and suitable restrictions imposed on the parameters (Condition 3.2). The proof of strong convergence is different from the previous proof [20]. Second, based on the approximate projection contraction method, we design an efficient implementation of the MRHSD method for a type of variational inequality problem.…”
Section: It Is Known That Xmentioning
confidence: 90%
“…In Section 4, we design an efficient and implementable nonexpansive mapping T for a type of variational problem based on the approximate projection contraction method. We then review the conditions and theorem presented by Xu et al [20].…”
Section: Convergence Theoremmentioning
confidence: 99%
See 3 more Smart Citations