Complexity analysis of a weighted-full-Newton step interior-point algorithm for<i>P</i><sub>∗</sub>(<i>κ</i>)-LCP (Q2798122): 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.1051/ro/2015020 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2239959958 / rank | |||
Normal rank | |||
Latest revision as of 20:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis of a weighted-full-Newton step interior-point algorithm for<i>P</i><sub>∗</sub>(<i>κ</i>)-LCP |
scientific article |
Statements
Complexity analysis of a weighted-full-Newton step interior-point algorithm for<i>P</i><sub>∗</sub>(<i>κ</i>)-LCP (English)
0 references
1 April 2016
0 references
linear complementarity problems
0 references
\(P_*(\kappa)\)-matrix
0 references
weighted-path-following
0 references
interior-point methods
0 references
polynomial complexity
0 references
