A proximal decomposition algorithm for variational inequality problems. (Q1412829): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.cam.2003.08.001 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.CAM.2003.08.001 / rank | |||
Normal rank |
Latest revision as of 19:39, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A proximal decomposition algorithm for variational inequality problems. |
scientific article |
Statements
A proximal decomposition algorithm for variational inequality problems. (English)
0 references
25 November 2003
0 references
The author considers the standard variational inequality over polyhedral constraints and presents a new decomposition method to solve the problem. First, he establishes a new decomposition algorithm solving at each iteration a system of nonlinear equations. Further he concludes the global convergence of the algorithm. Numerical illustrations are presented by the end of the paper.
0 references
variational inequalities
0 references
decomposition algorithms
0 references
global convergence
0 references
monotone mappings
0 references
numerical examples
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references