Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence (Q2007836)
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: Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence |
scientific article; zbMATH DE number 7135245
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence |
scientific article; zbMATH DE number 7135245 |
Statements
Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence (English)
0 references
22 November 2019
0 references
Nesterov-Todd (NT) direction
0 references
predictor-corrector primal-dual path following interior point algorithm
0 references
semi-definite linear complementarity problem
0 references
polynomial complexity
0 references
local convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9183984
0 references
0.9158025
0 references
0.9065454
0 references
0.90492696
0 references
0.9030824
0 references
0.90140456
0 references
0.9001149
0 references
0.8982219
0 references
