Linear complementarity problems solvable by a polynomially bounded pivoting algorithm (Q3707784)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3932818
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear complementarity problems solvable by a polynomially bounded pivoting algorithm |
scientific article; zbMATH DE number 3932818 |
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
0.8637538552284241
0 references
0.8533614277839661
0 references
0.8349023461341858
0 references
0.8328297138214111
0 references
0.83282071352005
0 references
