Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming (Q627455): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:49, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming |
scientific article |
Statements
Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming (English)
0 references
2 March 2011
0 references
The authors propose a second order interior point algorithm for symmetric cone programming, using a wide neighborhood of the central path. The basic tool of their analysis of the complexity bounds of the proposed methods is the theory of Euclidean Jordan algebras. Polynomial convergence for several infeasible and feasible interior point methods is also established.
0 references
symetric cone
0 references
Euclidean Jordan algebra
0 references
interior point method
0 references
