Conditional Extragradient Algorithms for Solving Constrained Variational Inequalities

In this paper, we generalize the classical extragradient algorithm for solving variational inequality problems by utilizing non-null normal vectors of the feasible set. In particular, conceptual algorithms are proposed with two different linesearches. We then establish convergence results for these algorithms under mild assumptions. Our study suggests that non-null normal vectors may significantly improve convergence if chosen appropriately.

Article

Download

View Conditional Extragradient Algorithms for Solving Constrained Variational Inequalities