Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
- Cite this article as:
- Harker, P.T. Mathematical Programming (1988) 41: 29. doi:10.1007/BF01580752
- 162 Downloads
This paper presents an acceleration step for the linearly convergent diagonalization and projection algorithms for finite-dimensional variational inequalities which is reminiscent of a PARTAN step in nonlinear programming. After establishing the convergence of this technique for both algorithms, several numerical examples are presented to illustrate the sometimes dramatic savings in computation time which this simple acceleration step yields.