On a commutative class of search directions for linear programming over symmetric cones (Q1599289): Difference between revisions
From MaRDI portal
Latest revision as of 10:29, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a commutative class of search directions for linear programming over symmetric cones |
scientific article |
Statements
On a commutative class of search directions for linear programming over symmetric cones (English)
0 references
9 June 2002
0 references
The author investigates the complexity of rather general path-following techniques for linear programming problems over symmetric cones. In particular, a commutative class of search directions is studied. As abstract tool the author uses the approach given in the book \textit{J. Faraut} and \textit{A. Korányi} [Analysis on symmetric cones. Clarendon Press, Oxford (1994; Zbl 0841.43002)]. A study of it is recommended to be easier able to follow the applied concept of Euclidean Jordan algebra and Pierce decomposition.
0 references
Symmetric cones
0 references
primal-dual interior point methods
0 references
Euclidean Jordan algebra
0 references
complexity
0 references
0 references
0 references
0 references
