A class of projection and contraction methods for monotone variational inequalities

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming (2015, methodology): “Following the standard analytic framework of contraction methods in [1, 15], the assertion (4.”
Parallel Multi-Block ADMM with o(1 / k) Convergence (2013, unknown): “The convergence of the algorithm follows immediately from the standard analysis for contraction methods (see, e.g., [14]).”
Some recent advances in projection-type methods for variational inequalities (2003, methodology): “9rst appeared in Sun [107] as an auxiliary vector function and later was used in He [44], Solodov and Tseng [103] and Sun [108] for solving monotone VI(F; X ).”
Projection methods with alternating inertial steps for variational inequalities: Weak and linear convergence (2020, methodology): “1 Contributions and Related Work He [19] introduced the projection and contraction method for solving VI(A,C) (1):  yn = PC(xn − λAxn), dn = xn − yn − λ(Axn − Ayn), xn+1 = xn − γηndn, (7)”
A Novel Inertial Projection and Contraction Method for Solving Pseudomonotone Variational Inequality Problems (2019, methodology): “The third one is the projection and contraction method studied by some authors [31, 52].”