A polynomial-time algorithm for a class of linear complementarity problems (Q1123139): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:02, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for a class of linear complementarity problems |
scientific article |
Statements
A polynomial-time algorithm for a class of linear complementarity problems (English)
0 references
1989
0 references
polynomial-time algorithm
0 references
Karmarkar's algorithm
0 references
path of centers
0 references
