A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem (Q5287986)
From MaRDI portal
scientific article; zbMATH DE number 243325
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem |
scientific article; zbMATH DE number 243325 |
Statements
A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem (English)
0 references
5 August 1993
0 references
potential reduction algorithm
0 references
linear complementarity
0 references
polynomial-time approximation scheme
0 references
\(\varepsilon\)-approximate stationary point
0 references
polynomal-time algorithm
0 references
