zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Three-steps iterative algorithms for mixed variational inequalities. (English) Zbl 1111.65058

Three-step iterative algorithms for mixed variational inequalities are presented. For finding the approximation solution of various types of variational inequalities and complementarity problems, projection and contraction methods are used. Due to the presence of a nonlinear term in the mixed variational inequality, the projection method and its variant forms can not be applied to suggest iterative algorithms for solving mixed variational inequalities. In the case that the nonlinear term is a proper, convex and lower semicontinuous function, there exists an equivalence between the mixed variational inequalities and the fixed point and the resolvent equations.

Main result: The new iterative method is obtained by using of three steps under suitable conditions. For the new method a proof of global convergence (requires only pseudomonotonicity) is proposed. Numerical experiments show that the authors’ method is more flexible and efficient to solve the traffic equilibrium problem.

65K10Optimization techniques (numerical methods)
49J40Variational methods including variational inequalities
49M25Discrete approximations in calculus of variations