Complexity of Mehrotra's predictor-corrector algorithms for monotone linear complementarity problems (Q3072041)
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 5847023
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Mehrotra's predictor-corrector algorithms for monotone linear complementarity problems |
scientific article; zbMATH DE number 5847023 |
Statements
5 February 2011
0 references
monotone linear complementarity problems
0 references
Mehrotra-type predictor-corrector algorithms
0 references
polynomial complexity
0 references
0.9019367694854736
0 references
0.8870443105697632
0 references
0.8828657865524292
0 references
0.8828657865524292
0 references
0.8823354244232178
0 references
