Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (Q364723): Difference between revisions
From MaRDI portal
Revision as of 20:14, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs |
scientific article |
Statements
Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (English)
0 references
9 September 2013
0 references
The authors consider interior-point algorithms for semi-definite programming and symmetric conic programming problems. They apply a differential geometric framework, the so-called information geometry, to these classes of problems and show relationships between complexity analysis and the curvature integral taken along the central path.
0 references
interior-point methods
0 references
iteration complexities
0 references
curvature integral
0 references
semidefinite programs
0 references
symmetric cone programs
0 references
conic programming
0 references
information geometry
0 references
0 references
0 references
0 references
0 references
0 references
