An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 12192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems |
scientific article; zbMATH DE number 12192 |
Statements
An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (English)
0 references
25 June 1992
0 references
interior point algorithm
0 references
positive semi-definite linear complementarity
0 references
approximate solution
0 references
potential function
0 references
central path following algorithm
0 references
potential reduction
0 references
Karmarkar's algorithm
0 references
central trajectory
0 references
0 references
0 references
0.9021556973457336
0 references
0.8649768233299255
0 references
