110 research outputs found

    Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming

    Get PDF
    In this paper we generalize the primal--dual cone affine scaling algorithm of Sturm and Zhang to semidefinite programming. We show in this paper that the underlying ideas of the cone affine scaling algorithm can be naturely applied to semidefinite programming, resulting in a new algorithm. Compared to other primal--dual affine scaling algorithms for semidefinite programming, our algorithm enjoys the lowest computational complexity
    • ā€¦
    corecore