Complexity bounds for a combined relaxation method (Q5954338): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23:48, 4 March 2024
scientific article; zbMATH DE number 1699575
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity bounds for a combined relaxation method |
scientific article; zbMATH DE number 1699575 |
Statements
Complexity bounds for a combined relaxation method (English)
0 references
3 June 2002
0 references
The author proposes a simple iterative method for variational inequalities with a set-valued main operator. The method requires no a priori knowledge of the problem's characteristics and converges if a solution to the dual variational inequality exists, which is a weaker assumption than the requirement that the main operator be quasi-monotone.
0 references
variational inequality
0 references
convex set
0 references
set-valued operator
0 references
iterative method
0 references
convergence
0 references
dual inequality
0 references
solution
0 references
