A relaxed projection method for variational inequalities (Q3732440)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3964835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A relaxed projection method for variational inequalities |
scientific article; zbMATH DE number 3964835 |
Statements
A relaxed projection method for variational inequalities (English)
0 references
1986
0 references
projection methods
0 references
algorithm
0 references
Convergence criteria
0 references
0 references
0.8462998270988464
0 references
0.8460707664489746
0 references
0.8354431390762329
0 references
0.8307026624679565
0 references
Let K be a closed convex set in \(R^ n\), f a mapping from \(R^ n\) into itself, then consider the problem of finding \(u\in K\) such that (*) (f(u),v-u)\(\geq 0\), for all \(v\in K\). It is well known that the projection methods can be used to find the approximate solution of (*) numerically. In this paper, the author presents a modification. In the proposed modified algorithm, each iteration consists of a projection onto a half space containing the given closed set rather the latter set itself, which makes the implementation of the algorithm easy as compared to the standard projection methods. Convergence criteria are also discussed along with some examples.
0 references