New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP (Q497434)
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: New complexity analysis of a full-Newton step feasible interior-point algorithm for P_()-LCP |
scientific article; zbMATH DE number 6484979
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP |
scientific article; zbMATH DE number 6484979 |
Statements
New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP (English)
0 references
24 September 2015
0 references
interior-point methods
0 references
\(P_\ast(\kappa)\)-matrix
0 references
linear complementarity problem
0 references
full-Newton step
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9307815432548524
0 references
0.9073169231414796
0 references
0.8927780985832214
0 references
