Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions (Q1572670)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions |
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
