Goldstein A A. Convex programming in Hilbert space[J]. Bull Am Math Soc,1964,70:709.
[2]
Levitin E S, Polyak B T. Constrained minimization problems[J]. USSR Comput Math Math Phys,1966,6:1.
[3]
Korpelevich G M. The extragradient method for finding saddle points and other problems[J]. Matecon,1976,12:747.
[4]
He B S, Yuan X M, Zhang J Z. Comparison of two kinds of prediction-correction methodsfor monotone variational inequalities[J]. Comput Optim Appl,2004,27:247-267.
[5]
Yan X H, Han D R, Sun W Y. A self-adaptive projection method with improved step-size for solving variational inequalities[J]. Comput Math Appl,2008,55(4):819-832.
[6]
Xu M H, Yuan X M, Huang Q L. An improved general extra-gradient method with refined step size for nonlinear monotone variational inequalities[J]. J Glob Optim,2007,39:155-169.
[7]
韩继业,修乃华,戚厚铎. 非线性互补理论与算法[M]. 上海:上海科学技术出版社,2003.
[8]
Ahmad K, Kazmi K R, Rehman N. Fixed-point technique for implicit comlementarity problem in Hilberet lattice[J]. J Optim Theo Appl,1997,93:72-97.
