Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions (Q2898536)
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: Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions |
scientific article; zbMATH DE number 6054570
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions |
scientific article; zbMATH DE number 6054570 |
Statements
11 July 2012
0 references
interior-point algorithm
0 references
path-following methods
0 references
semidefinite linear complementarity problems
0 references
Polynomial convergence of primal-dual algorithms for SDLCP based on the M-Z family of directions (English)
0 references
0.9597287178039552
0 references
0.9465793371200562
0 references
0.8908629417419434
0 references
0.8908629417419434
0 references
