The extragradient method for solving variational inequalities in the presence of computational errors

DOI10.1007/S10957-011-9975-3zbMATH Open1251.49015OpenAlexW1983109191MaRDI QIDQ438778FDOQ438778

Alexander J. Zaslavski

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

Recommendations

• The subgradient method for solving variational inequalities with computational errors in a Hilbert space
• The extragradient method for finding a common solution of a finite family of variational inequalities and a finite family of fixed point problems in the presence of computational errors
• The extragradient method for convex optimization in the presence of computational errors
• The projected subgradient method for nonsmooth convex optimization in the presence of computational errors
• Subgradient projection algorithms for convex feasibility problems in the presence of computational errors

zbMATH Keywords

Hilbert spacevariational inequalitycomputational errorsubgradient method

Mathematics Subject Classification ID

Variational inequalities (49J40) Methods of reduced gradient type (90C52)

Cites Work

• Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• On monotone variational inequalities with random data
• Title not available (Why is that?)
• The subgradient extragradient method for solving variational inequalities in Hilbert space
• Hilbert-Valued Perturbed Subgradient Algorithms
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• Full convergence of the steepest descent method with inexact line searches
• Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces
• An inexact interior point proximal method for the variational inequality problem
• Descent method with inexact linesearch for mixed variational inequalities
• 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
• Bregman-like functions and proximal methods for variational problems with nonlinear constraints

Cited In (1)

• A regularized method for solving variational and quasivariational inequalities involving errors

This page was built for publication: The extragradient method for solving variational inequalities in the presence of computational errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438778)