An extension of predictor-corrector algorithm to a class of convex separable program (Q1375337)
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: An extension of predictor-corrector algorithm to a class of convex separable program |
scientific article; zbMATH DE number 1104079
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An extension of predictor-corrector algorithm to a class of convex separable program |
scientific article; zbMATH DE number 1104079 |
Statements
An extension of predictor-corrector algorithm to a class of convex separable program (English)
0 references
8 September 1998
0 references
It is shown that a modification of the Mizuno-Todd-Ye predictor-corrector method reduces the duality gap by a constant factor in each corrector step. This result is applicable for convex separable programming.
0 references
interior-point method
0 references
Mizuno-Todd-Ye predictor-corrector method
0 references
convex separable programming
0 references
0.8266474008560181
0 references
0.8080253005027771
0 references
0.7940030097961426
0 references
0.7773579955101013
0 references
