Right-hand side decomposition for variational inequalities (Q2250070): Difference between revisions
From MaRDI portal
Latest revision as of 17:03, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Right-hand side decomposition for variational inequalities |
scientific article |
Statements
Right-hand side decomposition for variational inequalities (English)
0 references
4 July 2014
0 references
The author considers a general class of variational inequality problems with functional binding constraints in a finite-dimensional space setting. The cost mapping need not be the gradient of any function, i.e. the problem is not equivalent to an optimization problem. The author suggests to use the so-called right-hand side decomposition technique and to transform it into a collection of small dimensional variational inequalities. The master problem is then a set-valued variational inequality whose solution gives us a solution of the initial problem. A general iterative method, which falls into the combined relaxation framework, is suggested for the master problem. It appears convergent under monotonicity assumptions. Moreover, a primal-dual regularization method for partial problems is also presented. It enables one to utilize single-valued approximations for the cost mapping of the master problem within the same decomposition approach, which leads to essentially simpler solution methods.
0 references
variational inequalities
0 references
right-hand side allocation
0 references
decomposition
0 references
regularization
0 references
penalty method
0 references
combined relaxation method
0 references
0 references
0 references
0 references
0 references