On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems (Q1819152): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1026492106091 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1508337438 / rank | |||
Normal rank | |||
Latest revision as of 10:46, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems |
scientific article |
Statements
On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems (English)
0 references
5 January 2000
0 references
linear complementarity problem
0 references
interior point method
0 references
high-order algorithm
0 references
local convergence
0 references
\(P_*\)-linear complementarity problem
0 references
