Decomposition method for a class of monotone variational inequality problems

被引:5
|
作者
He, BS [1 ]
Liao, LZ
Yang, H
机构
[1] Nanjing Univ, Dept Math, Nanjing 210008, Peoples R China
[2] Hong Kong Baptist Univ, Dept Math, Kowloon, Peoples R China
[3] Hong Kong Univ Sci & Technol, Dept Civil Engn, Kowloon, Peoples R China
基金
中国国家自然科学基金;
关键词
monotone variational inequalities; decomposition methods; convergence;
D O I
10.1023/A:1021736008175
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In the solution of the monotone variational inequality problem VI(Omega, F), with [GRAPHICS] the augmented Lagrangian method (a decomposition method) is advantageous and effective when Y = R-m. For some problems of interest, where both the constraint sets X and Y are proper subsets in R-n and R-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.
引用
收藏
页码:603 / 622
页数:20
相关论文
共 50 条