{
  "id": "1410.6734",
  "version": "v1",
  "published": "2014-10-24T16:47:02.000Z",
  "updated": "2014-10-24T16:47:02.000Z",
  "title": "A Polynomial-Time Affine-Scaling Method for Semidefinite and Hyperbolic Programming",
  "authors": [
    "James Renegar",
    "Mutiara Sondjaja"
  ],
  "categories": [
    "math.OC"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-10-24T16:47:02.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "90C51",
      "90C22"
    ],
    "keywords": [
      "hyperbolic programming",
      "semidefinite",
      "best complexity bounds",
      "first polynomial-time affine-scaling method",
      "conic optimization problems"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1410.6734R"
    }
  }
}