A wide-neighborhood path-following algorithms for a class of nonmonotonic linear complementary problems and its computational complexity (Q3501237)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A wide-neighborhood path-following algorithms for a class of nonmonotonic linear complementary problems and its computational complexity |
scientific article; zbMATH DE number 5283951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A wide-neighborhood path-following algorithms for a class of nonmonotonic linear complementary problems and its computational complexity |
scientific article; zbMATH DE number 5283951 |
Statements
3 June 2008
0 references
nonmonotonic linear complementary problem
0 references
\(P\)-matrix
0 references
wide-neighborhood path-following method
0 references
computational complexity
0 references
0.8936389684677124
0 references
0.8728404641151428
0 references
