Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351)
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 analysis of a linear complementarity algorithm based on a Lyapunov function |
scientific article; zbMATH DE number 34351
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis of a linear complementarity algorithm based on a Lyapunov function |
scientific article; zbMATH DE number 34351 |
Statements
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (English)
0 references
28 June 1992
0 references
Karmarkar's method
0 references
path following
0 references
linear complementarity
0 references
positive semi-definite matrices
0 references
complexity analysis
0 references
rate of convergence
0 references
0 references
0 references
0 references
0 references
