An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (Q1181916)
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: An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem |
scientific article; zbMATH DE number 29031
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem |
scientific article; zbMATH DE number 29031 |
Statements
An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem (English)
0 references
27 June 1992
0 references
interior point algorithms
0 references
path following algorithm
0 references
linear complementarity
0 references
adaptive algorithm
0 references
0 references
0 references
0 references
0.90618384
0 references
0.8973066
0 references
0.8877824
0 references
0.88276017
0 references
