Conditional extragradient algorithms for solving variational inequalities

2014/11/17 by Cruz, J. Y. Bello, Millán, R. Díaz, Phan, Hung M.
#65K15 #FOS: Mathematics #Optimization and Control (math.OC) #Primary: 58E35 #Secondary: 49J40

paper · doi:10.48550/arxiv.1411.4338

Abstract

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

Related

• A modified subgradient extragradient method for solving the variational inequality problem
• Extragradient method with feasible inexact projection to variational inequality problem
• On the Convergence Properties of Non-Euclidean Extragradient Methods for Variational Inequalities with Generalized Monotone Operators
• Beyond Monotone Variational Inequalities: Solution Methods and Iteration Complexities
• On the Hypomonotone Class of Variational Inequalities