Conditional extragradient algorithms for solving variational inequalities
From MaRDI portal
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.
Recommendations
- A new extragradient-like method for solving variational inequality problems
- scientific article; zbMATH DE number 1950372
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- Convergence of the modified extragradient method for variational inequalities with non-Lipschitz operators
- A new extragradient method for generalized variational inequality in Euclidean space
Cited in
(8)- Alternating conditional gradient method for convex feasibility problems
- A strongly convergent proximal point method for vector optimization
- An algorithm for best generalised rational approximation of continuous functions
- A projection algorithm for non-monotone variational inequalities
- A new iterative method for solving pseudomonotone variational inequalities with non-Lipschitz operators
- A linesearch projection algorithm for solving equilibrium problems without monotonicity in Hilbert spaces
- On the weak and strong convergence of modified forward-backward-half-forward splitting methods
- Extragradient method with feasible inexact projection to variational inequality problem
This page was built for publication: Conditional extragradient algorithms for solving variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963664)
