Auslender A, Teboulle M. Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities[J]. Math Program,2009,120(1):27-48.
[3]
Rockfellar R T. Monotone operators and the proximal point algorithm[J]. SIAM J Control Optim,1976,14:877-898.
[4]
Iusem A N, Svaiter B F, Teboulle M. Entropy-like proximal methods in convex programming[J]. Math Oper Res,1994,19:790-814.
[5]
Xia F Q, Huang N J, Liu Z B. A projected subgradient method for solving generalized mixed variational inequalities[J]. Operations Research Letters,2008,36:637-642.
[6]
Korpelevich G M. The extragradient method for finding saddle points and other problems[J]. Matecon,1976,12:747-756.
[7]
Hadjisavvas N, Schaible S. Pseudomonotone maps and the cutting plane property[J]. Glob Optim,2009,43:565-575.
[8]
Ceng L C, Schaible S, Yao J C. Existence of solutions for generalized vector variational-like inequalities[J]. Optim Theory Appl,2008,137:121-133.
[9]
Crouzeix J P, Marcotte P, Zhu D L. Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities[J]. Math Program,2000,88(3):521-539.
[10]
Alber Y I, Iusem A N, Solodov M V. On the projected subgradient method for nonsmooth convex optimization in a Hilbert space[J]. Math Program,1998,81(1):23-35.
[11]
Nadler S B. Multi-valued contraction mappings[J]. J Pacific Math,1969,30:475-488.
