Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions (Q1572670): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:22, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions |
scientific article |
Statements
Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions (English)
0 references
21 July 2000
0 references
semidefinite programming
0 references
interior-point methods
0 references
polynomial complexity
0 references
path-following methods
0 references
primal-dual methods
0 references
