Polynomial Primal Dual Cone Affine Scaling for Semidefinite Programming

Abstract

Semide nite programming concerns the problem of optimizing a linear function over a section of the cone of semide nite matrices In the cone a ne scaling approach we replace the cone of semide nite matrices by a certain inscribed cone in such a way that the resulting optimization problem is analytically solvable The now easily obtained solution to this modi… (More)

Topics

  • Presentations referencing similar topics