On the convergence rate of two projection methods for variational inequalities in R^ n
From MaRDI portal
Publication:1324745
Recommendations
Cites work
- Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
- An iterative scheme for variational inequalities
- Convex programming and variational inequalities
- Convex programming, variational inequalities, and applications to the traffic equilibrium problem
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Projection methods for variational inequalities with application to the traffic assignment problem
Cited in
(11)- An extended descent framework for variational inequalities
- Convergence rate analysis of iteractive algorithms for solving variational inequality problems
- On the convergence of projection methods: Application to the decomposition of affine variational inequalities
- On the iteration complexity of some projection methods for monotone linear variational inequalities
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- scientific article; zbMATH DE number 1383431 (Why is no real title available?)
- A simple proof for some important properties of the projection mapping
- scientific article; zbMATH DE number 832183 (Why is no real title available?)
- Convergence properties of projection and contraction methods for variational inequality problems
- Unified framework of extragradient-type methods for pseudomonotone variational inequalities.
- Local linear convergence of an outer approximation projection method for variational inequalities
This page was built for publication: On the convergence rate of two projection methods for variational inequalities in \(\mathbb{R}^ n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1324745)
