Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming (Q4916315)
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 6156382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming |
scientific article; zbMATH DE number 6156382 |
Statements
Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming (English)
0 references
22 April 2013
0 references
semidefinite optimization
0 references
full-Newton step
0 references
iteration bound
0 references
infeasible interior-point algorithm
0 references
0 references
0 references
0 references
0.8691350221633911
0 references
0.8672206997871399
0 references
0.8524696230888367
0 references
0.8519392609596252
0 references
