A full NT-step infeasible interior-point algorithm for semidefinite optimization (Q4603922)
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 6842832
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A full NT-step infeasible interior-point algorithm for semidefinite optimization |
scientific article; zbMATH DE number 6842832 |
Statements
A full NT-step infeasible interior-point algorithm for semidefinite optimization (English)
0 references
23 February 2018
0 references
semidefinite optimization
0 references
infeasible interior-point method
0 references
convergence analysis
0 references
polynomial complexity
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.9668575
0 references
0.95912004
0 references
0.95371276
0 references
0.9453385
0 references
0.94176304
0 references
0.93372273
0 references
0.93203264
0 references
0.9316606
0 references
0.92935556
0 references
