An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems (Q1176569): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01594942 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044061073 / rank | |||
Normal rank | |||
Latest revision as of 08:58, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems |
scientific article |
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
