Abstract
In the solution of the monotone variational inequality problem VI (Ω, F), with (Formula Presented) uJ*l F(u) = \f(x)-ATy\ V = VXV, Iy J IAx-b J the augmented Lagrangian method (a decomposition method) is advantageous and effective when script Y sign = ℛm. For some problems of interest, where both the constraint sets script X sign and script Y sign are proper subsets in ℛn and ℛm, the original augmented Lagrangian method is no longer applicable. For this class of variational inequality problems, we introduce a decomposition method and prove its convergence. Promising numerical results are presented, indicating the effectiveness of the proposed method.
| Original language | English |
|---|---|
| Pages (from-to) | 603-622 |
| Number of pages | 20 |
| Journal | Journal of Optimization Theory and Applications |
| Volume | 103 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Dec 1999 |
Keywords
- Convergence
- Decomposition methods
- Monotone variational inequalities
Fingerprint
Dive into the research topics of 'Decomposition method for a class of monotone variational inequality problems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver