Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems (Q2458697)
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: Complexity of large-update interior point algorithm for P_*( ) linear complementarity problems |
scientific article; zbMATH DE number 5207950
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems |
scientific article; zbMATH DE number 5207950 |
Statements
Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems (English)
0 references
2 November 2007
0 references
primal-dual interior point method
0 references
Kernel function
0 references
complexity
0 references
polynomial algorithm
0 references
large-update
0 references
linear complementarity problem
0 references
0 references
0 references
0 references
0 references
0.9815855026245116
0 references
0.935647428035736
0 references
0.9327000379562378
0 references
0.9311193227767944
0 references
