A primal-dual infeasible interior point algorithm for semidefinite programming (Q5310748)
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 5200604
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A primal-dual infeasible interior point algorithm for semidefinite programming |
scientific article; zbMATH DE number 5200604 |
Statements
12 October 2007
0 references
semidefinite programming
0 references
interior point algorithm
0 references
infeasible interior point algorithm
0 references
0.8692736029624939
0 references
0.8564541935920715
0 references
0.8554721474647522
0 references
0.8527622818946838
0 references
0.8490888476371765
0 references
