1994
DOI: 10.1006/jmaa.1994.1361
|View full text |Cite
|
Sign up to set email alerts
|

Iterative Algorithms for Finding Approximate Solutions for General Strongly Nonlinear Variational Inequalities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

1996
1996
2016
2016

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 45 publications
(16 citation statements)
references
References 0 publications
0
16
0
Order By: Relevance
“…6. Theorem 3.1 of Chang [4], generalizes and improves the results in [16,17,18,21,27,28,30], so Theorems 3.1 and 3.3 extend and establish random generalization of the work of [16,17,18,21,27,28,30].…”
Section: Applicationsmentioning
confidence: 78%
“…6. Theorem 3.1 of Chang [4], generalizes and improves the results in [16,17,18,21,27,28,30], so Theorems 3.1 and 3.3 extend and establish random generalization of the work of [16,17,18,21,27,28,30].…”
Section: Applicationsmentioning
confidence: 78%
“…(III) If for all x, y ∈ K, η(y, x) = y − x, and f (x) = 0, then problem (1) reduces to the strongly nonlinear variational inequality problem considered by Siddiqi and Ansari [10] , and Zeng [12,13] : find x * ∈ K such that…”
Section: Some Special Cases (I) Ifmentioning
confidence: 99%
“…In the setting of Hilbert spaces, one of the most efficient numerical techniques is the projection method and its variant forms; see 4,[6][7][8][9][10][11][12][13][14][15] . Since the standard projection method strictly depends on the inner product property of Hilbert spaces, it can no longer be applied for general mixed type variational inequalities in Banach spaces.…”
Section: Fixed Point Theory and Applicationsmentioning
confidence: 99%