A class of linear complementarity problems solvable in polynomial time (Q1174838): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q192567 |
||
| Property / reviewed by | |||
| Property / reviewed by: Thomas F. Coleman / rank | |||
Revision as of 18:06, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of linear complementarity problems solvable in polynomial time |
scientific article |
Statements
A class of linear complementarity problems solvable in polynomial time (English)
0 references
25 June 1992
0 references
The authors show that a class of linear complementarity problems is solvable in polynomial time using a potential reduction algorithm.
0 references
polynomial complexity
0 references
quadratic programming
0 references
linear complementarity problems
0 references
potential reduction algorithm
0 references
