zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
Strong convergence of three-step relaxed hybrid steepest-descent methods for variational inequalities. (English) Zbl 1158.65047

The paper shows strong convergence of a three-step relaxed hybrid steepest-descent method for solving variational inequalities defined by means of Lipschitzian and strongly monotone operators.

The convergence proof is slightly simpler that the one given by X. P. Ding, Y. C. Lin and J. C. Yao [Appl. Math. Mech., Engl. 28, 1029–1036 (2007; Zbl 1231.49004)] and is obtained under different assumptions on the parameters involved in the iterative procedure, than in the reference mentioned above.

The last part of the paper is devoted to the constrained pseudo-inverse problem which can be formulated as a variational inequality, as shown by H. K. Xu and T. H. Kim [J. Optimization Theory Appl. 119, 185–201 (2003; Zbl 1045.49018)].

Reviewer’s remark: I would like to point out that the authors probably meant the notation “Fix(T)=S b ” in the last section, instead of “F(T)=S b ”.

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