Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming (Q1434073)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2077958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming |
scientific article; zbMATH DE number 2077958 |
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
0.96050334
0 references
0.9365672
0 references
0.9305428
0 references
0.9278439
0 references
0.9236778
0 references
0 references
0.9236491
0 references
