A Polynomial-Time Affine-Scaling Method for Semidefinite and Hyperbolic Programming
From MaRDI portal
Abstract: We develop a natural variant of Dikin's affine-scaling method, first for semidefinite programming and then for hyperbolic programming in general. We match the best complexity bounds known for interior-point methods. All previous polynomial-time affine-scaling algorithms have been for conic optimization problems in which the underlying cone is symmetric. Hyperbolicity cones, however, need not be symmetric. Our algorithm is the first polynomial-time affine-scaling method not relying on symmetry.
This page was built for publication: A Polynomial-Time Affine-Scaling Method for Semidefinite and Hyperbolic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6255773)
