A new infeasible-interior-point algorithm for linear programming over symmetric cones (Q2401787)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6769515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new infeasible-interior-point algorithm for linear programming over symmetric cones |
scientific article; zbMATH DE number 6769515 |
Statements
A new infeasible-interior-point algorithm for linear programming over symmetric cones (English)
0 references
5 September 2017
0 references
symmetric cone
0 references
Euclidean Jordan algebra
0 references
interior-point methods
0 references
linear programming
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0.9322904348373412
0 references
0.903692364692688
0 references
0.869465708732605
0 references
