Polynomial complexity bounds of Mehrotra-type predictor-corrector algorithms for linear programming over symmetric cones (Q2994022)
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: Polynomial complexity bounds of Mehrotra-type predictor-corrector algorithms for linear programming over symmetric cones |
scientific article; zbMATH DE number 6612529
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial complexity bounds of Mehrotra-type predictor-corrector algorithms for linear programming over symmetric cones |
scientific article; zbMATH DE number 6612529 |
Statements
10 August 2016
0 references
linear programming
0 references
symmetric cone
0 references
Euclidean Jordan algebra
0 references
interior point methods
0 references
Mehrotra-type algorithm
0 references
polynomial complexity
0 references
0.9100065231323242
0 references
0.8781824111938477
0 references
0.8762888312339783
0 references
0.8568615913391113
0 references
