The largest step path following algorithm for monotone linear complementarity problems (Q1363413)
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: The largest step path following algorithm for monotone linear complementarity problems |
scientific article; zbMATH DE number 1046458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The largest step path following algorithm for monotone linear complementarity problems |
scientific article; zbMATH DE number 1046458 |
Statements
The largest step path following algorithm for monotone linear complementarity problems (English)
0 references
10 March 1998
0 references
linear complementarity
0 references
primal-dual interior-point algorithm
0 references
convergence of algorithms
0 references
path-following
0 references
\(Q\)-quadratic convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.865066409111023
0 references
0.8523014187812805
0 references
0.8448219895362854
0 references
