Article ID: | iaor2003744 |
Country: | Germany |
Volume: | 92 |
Issue: | 1 |
Start Page Number: | 103 |
End Page Number: | 118 |
Publication Date: | Jan 2002 |
Journal: | Mathematical Programming |
Authors: | Yang H., He B., Liao L.-Z., Han D. |
The alternating directions method (ADM) is an effective method for solving a class of variational inequalities (VI) when the proximal and penalty parameters in sub-VI problems are properly selected. In this paper, we propose a new ADM method which needs to solve two strongly monotone sub-VI problems in each iteration approximately and allows the parameters to vary from iteration to iteration. The convergence of the proposed ADM method is proved under quite mild assumptions and flexible parameter conditions.