A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem
From MaRDI portal
Publication:1338146
DOI10.1007/BF01581703zbMath0821.90115MaRDI QIDQ1338146
Publication date: 27 November 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Large-scale problems in mathematical programming (90C06) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Solution of symmetric linear complementarity problems by iterative methods
- Multi-sweep asynchronous parallel successive overrelaxation for the nonsymmetric linear complementarity problem
- A computational study of active set strategies in nonlinear programming with linear constraints
- Projected Newton Methods for Optimization Problems with Simple Constraints
This page was built for publication: A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem