The extragradient method for solving variational inequalities in the presence of computational errors
From MaRDI portal
Publication:438778
DOI10.1007/S10957-011-9975-3zbMath1251.49015OpenAlexW1983109191MaRDI QIDQ438778
Publication date: 31 July 2012
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-011-9975-3
Cites Work
- Unnamed Item
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- An inexact interior point proximal method for the variational inequality problem
- Descent method with inexact linesearch for mixed variational inequalities
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces
- On monotone variational inequalities with random data
- The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors
- Relaxed proximal point algorithms for variational inequalities with multi-valued operators
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Full convergence of the steepest descent method with inexact line searches
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Hilbert-Valued Perturbed Subgradient Algorithms
- Bregman-like functions and proximal methods for variational problems with nonlinear constraints
This page was built for publication: The extragradient method for solving variational inequalities in the presence of computational errors