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)
Unified framework of extragradient-type methods for pseudomonotone variational inequalities. (English) Zbl 1039.49014
Summary: We propose a unified framework of extragradient-type methods for solving pseudomonotone variational inequalities, which allows one to take different stepsize rules and requires the computation of only two projections at each iteration. It is shown that the modified extragradient method of {\it A. N. Iusem} and {\it B. F. Svaiter} [Optimization 42, No. 4, 309--321 (1977; Zbl 0891.90135)] falls within this framework with a short stepsize and so does the method of {\it M. V. Solodov} and {\it B. F.Svaiter} [SIAM J. Control Optimization 37, No. 3, 765--776 (1999; Zbl 0959.49007)] with a long stepsize. It is further demonstrated that the algorithmic framework is globally convergent under mild assumptions and is sublinearly convergent if in addition a projection-type error bound holds locally. Preliminary numerical experiments are reported.

49J40Variational methods including variational inequalities
90C33Complementarity and equilibrium problems; variational inequalities (finite dimensions)
Full Text: DOI