Complexity analysis of primaldual algorithms for the semidefinite linear complementarity problem (Q2839535)
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: Complexity analysis of primaldual algorithms for the semidefinite linear complementarity problem |
scientific article; zbMATH DE number 6187137
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis of primaldual algorithms for the semidefinite linear complementarity problem |
scientific article; zbMATH DE number 6187137 |
Statements
11 July 2013
0 references
semidefinite linear complementarity problems
0 references
interior point methods
0 references
long and small-update primal-dual algorithms
0 references
polynomial complexity
0 references
Complexity analysis of primaldual algorithms for the semidefinite linear complementarity problem (English)
0 references
