Projective algorithms for solving complementarity problems
From MaRDI portal
The authors consider the linear complementarity problem: Given: An \(n\times n\) matrix \(A\) and a vector \(b\in \mathbb{R}^n\), find: \(w,x\in\mathbb{R}^n\) such that \[ w\geq 0,\;x\geq 0,\;w=Ax-,\;w^Tx=0. \] For this problem, robust projective algorithms of the von Neuman type are presented. Convergence conditions are given and numerical tests are presented.
Recommendations
- A rapid algorithm for a class of linear complementarity problems
- A projected-gradient interior-point algorithm for complementarity problems
- scientific article; zbMATH DE number 844464
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- A finite improvement algorithm for the linear complementarity problem
Cited in
(6)- A projective simplex algorithm using LU decomposition
- A rapid algorithm for a class of linear complementarity problems
- scientific article; zbMATH DE number 2084778 (Why is no real title available?)
- The steepest descent barrier-projective method for linear complementarity problems
- A projected-gradient interior-point algorithm for complementarity problems
- On a ``stability in the linear complementarity problem
This page was built for publication: Projective algorithms for solving complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607818)
