On the convergence rate of two projection methods for variational inequalities in \(\mathbb{R}^ n\)
From MaRDI portal
Publication:1324745
DOI10.1007/BF02576182zbMath0794.65060MaRDI QIDQ1324745
Publication date: 26 May 1994
Published in: Calcolo (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Numerical methods based on nonlinear programming (49M37)
Related Items
Unified framework of extragradient-type methods for pseudomonotone variational inequalities. ⋮ An extended descent framework for variational inequalities
Cites Work
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Convex programming, variational inequalities, and applications to the traffic equilibrium problem
- Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
- Projection methods for variational inequalities with application to the traffic assignment problem
- An iterative scheme for variational inequalities
- Convex programming and variational inequalities