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)
Algorithms construction for variational inequalities. (English) Zbl 1215.49020
Summary: We devote this paper to solving the Variational Inequality (VI) of finding $x^*$ with property $x^*\in \text{Fix}(T)$ such that $\langle(A-\gamma f)x^*,x-x^*\rangle\ge 0$ for all $x\in \text{Fix}(T)$. Note that this hierarchical problem is associated with some convex programming problems. For solving the above VI, we suggest two algorithms: Implicit Algorithm: $x_t= TPc[I-t(A-\gamma f)]x_t$ for all $t\in(0,1)$ and Explicit Algorithm: $x_{n+1}= \beta_nx_n+(1-\beta_n) TPc[1-\alpha_n(A-\gamma f)]x_n$ for all $n\ge 0$ . It is shown that these two algorithms converge strongly to the unique solution of the above VI. As special cases, we prove that the proposed algorithms strongly converge to the minimum norm fixed point of $T$.

49J40Variational methods including variational inequalities
90C25Convex programming
Full Text: DOI EuDML