2006
DOI: 10.1016/j.amc.2006.05.086
|View full text |Cite
|
Sign up to set email alerts
|

Three-steps iterative algorithms for mixed variational inequalities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 34 publications
(22 citation statements)
references
References 19 publications
0
22
0
Order By: Relevance
“…This alternative equivalent form plays a crucial role in suggesting three-step iterative schemes for solving variational inequalities. It is now well-known [1,2,31] that the three-step iterative methods for solving the variational inequalities perform better numerically than two-step and one-step method. This fact motivates us to consider the three-step iterative schemes.…”
Section: Lemma 31 the Function U ∈ H Is A Solution Of The Mixed Varimentioning
confidence: 98%
See 2 more Smart Citations
“…This alternative equivalent form plays a crucial role in suggesting three-step iterative schemes for solving variational inequalities. It is now well-known [1,2,31] that the three-step iterative methods for solving the variational inequalities perform better numerically than two-step and one-step method. This fact motivates us to consider the three-step iterative schemes.…”
Section: Lemma 31 the Function U ∈ H Is A Solution Of The Mixed Varimentioning
confidence: 98%
“…It is well known that a large class of problems arising in industry, ecology, finance, economics, transportation, network analysis and optimization can be formulated and studied in the framework of (2.1) and (2.7), see [1][2][3] and the references therein.…”
Section: Lemma 21 Let F Be a Differentiable G-convex Function And ϕ mentioning
confidence: 99%
See 1 more Smart Citation
“…In recent years, variational inequality theory has been extended and generalized in several directions, using new and powerful methods, to study a wide class of unrelated problems in a unified and general framework. It turned out that odd-order and nonsymmetric obstacle, free, nonlinear equilibrium, dynamical network, optimal design, bifurcation and chaos, and moving boundary problems arising in various branches of pure and applied sciences can be studied via variational inequalities; see [1,2,[5][6][7][8][12][13]17]. One of the most important and difficult problems in this theory is the development of an efficient and implementable iterative algorithm for solving variational inequalities.…”
Section: Introductionmentioning
confidence: 99%
“…Variational inequalities introduced by Stampacchia [1] in the early sixties have witnessed an explosive growth in theoretical advances, algorithmic development, and applications across all the discipline of pure and applied sciences; see [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17], and the references therein. In recent years, variational inequality theory has been extended and generalized in several directions, using new and powerful methods, to study a wide class of unrelated problems in a unified and general framework.…”
Section: Introductionmentioning
confidence: 99%