Linear complementarity problems solvable by a polynomially bounded pivoting algorithm (Q3707784): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:24, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear complementarity problems solvable by a polynomially bounded pivoting algorithm |
scientific article |
Statements
Linear complementarity problems solvable by a polynomially bounded pivoting algorithm (English)
0 references
1985
0 references
parametric principal pivoting
0 references
linear complementarity
0 references
P-matrix
0 references
hidden Z transpose
0 references
strictly diagonally dominant matrix
0 references
polynomial testing procedure
0 references
