The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight (Q2325239)
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: The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight |
scientific article; zbMATH DE number 7102523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight |
scientific article; zbMATH DE number 7102523 |
Statements
The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight (English)
0 references
9 September 2019
0 references
curvature
0 references
central path
0 references
polytopes
0 references
complexity
0 references
interior-point methods
0 references
linear optimization
0 references
0.8399839997291565
0 references
0.8301550149917603
0 references
0.8153012990951538
0 references
0.8039650321006775
0 references
0.7856289148330688
0 references
