Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming (Q1434073)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming |
scientific article |
Statements
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming (English)
0 references
1 July 2004
0 references
semidefinite programming
0 references
primal-dual
0 references
infeasible interior point method
0 references
inexact search direction
0 references
polynomial complexity
0 references
