On the Superlinear Convergence of an $O(n^3 L)$ Interior-Point Algorithm for the Monotone LCP (Q4717552)
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: On the Superlinear Convergence of an O(n^3 L) Interior-Point Algorithm for the Monotone LCP |
scientific article; zbMATH DE number 952578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Superlinear Convergence of an $O(n^3 L)$ Interior-Point Algorithm for the Monotone LCP |
scientific article; zbMATH DE number 952578 |
Statements
On the Superlinear Convergence of an $O(n^3 L)$ Interior-Point Algorithm for the Monotone LCP (English)
0 references
1 December 1996
0 references
partial updating
0 references
polynomial superlinearly convergent algorithm
0 references
monotone linear complementarity problem
0 references
\(\varepsilon\)-optimality
0 references
0.8999058604240417
0 references
0.8695757389068604
0 references
0.8628664612770081
0 references
0.8568728566169739
0 references
