2016
DOI: 10.1007/s11075-016-0253-1
|View full text |Cite
|
Sign up to set email alerts
|

Strong convergence result for monotone variational inequalities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

7
41
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 73 publications
(48 citation statements)
references
References 39 publications
7
41
0
Order By: Relevance
“…2. In the industrial Example 5.1, Table 1 clearly shows that our proposed algorithm is better (cpu time taken and number of iterations) compared to that of YNE algorithm proposed in [41] for different values of N . 3.…”
Section: : Computementioning
confidence: 91%
See 3 more Smart Citations
“…2. In the industrial Example 5.1, Table 1 clearly shows that our proposed algorithm is better (cpu time taken and number of iterations) compared to that of YNE algorithm proposed in [41] for different values of N . 3.…”
Section: : Computementioning
confidence: 91%
“…Observe that, in finding α n , the operator A is evaluated (possibly) many times, but no extra projections onto the set C are needed. This is in contrast to a couple of related algorithms for the solution of monotone variational inequalities where the calculation of a suitable stepsize requires (possibly) many projections onto C, see, e.g., [14,27,41] 4. Convergence analysis.…”
Section: Algorithm 31 Extragradient-type Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Very recently, solving the VIP (5) when A is a Lipschitz continuous monotone mapping such that the Lipschitz constant is unknown in Hilbert spaces by using the following viscosity-type subgradient extragradient-like method was proposed by Shehu and Iyiola [19].…”
Section: Pseudo-monotone Ifmentioning
confidence: 99%