On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms (Q1890928)
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: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms |
scientific article; zbMATH DE number 758363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms |
scientific article; zbMATH DE number 758363 |
Statements
On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms (English)
0 references
28 May 1995
0 references
predictor-corrector primal-dual interior-point algorithm
0 references
theoretical convergence
0 references
polynomial complexity bounds
0 references
0 references
0 references
0.9287163
0 references
0.92848456
0 references
0.9266155
0 references
0.9219002
0 references
0.91656494
0 references
0.9147221
0 references
0.9137909
0 references
0.91163737
0 references
0.9027642
0 references
