A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming (Q3066932)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming |
scientific article; zbMATH DE number 5839316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming |
scientific article; zbMATH DE number 5839316 |
Statements
A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming (English)
0 references
20 January 2011
0 references
semidefinite programming
0 references
path-following interior-point method
0 references
iteration-complexity bound
0 references
0 references
0 references
0 references
0.9790338
0 references
0.9505465
0 references
0.9461674
0 references
0.9444401
0 references
0.9418497
0 references
0.9388865
0 references
0.92820597
0 references
0.9266536
0 references
