A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm (Q5317499)
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 New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm |
scientific article; zbMATH DE number 2206178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm |
scientific article; zbMATH DE number 2206178 |
Statements
A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm (English)
0 references
16 September 2005
0 references
interior-point algorithms
0 references
primal-dual algorithms
0 references
path-following
0 references
central path
0 references
layered least squares steps
0 references
condition number
0 references
polynomial complexity
0 references
crossover events
0 references
linear programming
0 references
scale-invariance
0 references
predictor-corrector
0 references
affine scaling
0 references
convergence
0 references
0.7686958
0 references
0.76146245
0 references
0.75524765
0 references
0.75444937
0 references
0.75241464
0 references
0.7417631
0 references
0.73952967
0 references
0.73529214
0 references
0.7342824
0 references
