### Abstract

Semidefinite programming concerns the problem of optimizing a linear function over a section of the cone of semidefinite matrices. In the cone affine scaling approach, we replace the cone of semidefinite 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 modified problem serves as an approximate solution to the semidefinite programming problem. The inscribed cones that we use are affine transformations of second order cones, hence the name ‘cone affine scaling’. Compared to other primal-dual affine scaling algorithms for semidefinite programming (see de klerk, roos and terlaky (1997)), our algorithm enjoys the lowest computational complexity.

Original language | English |
---|---|

Pages (from-to) | 317-333 |

Journal | Applied Numerical Mathematics |

Volume | 29 |

DOIs | |

Publication status | Published - 1 Jan 1999 |

## Cite this

Berkelaar, A. B., Sturm, J. F., & Zhang, S. (1999). Polynomial primal-dual cone affine scaling for semidefinite programming.

*Applied Numerical Mathematics*,*29*, 317-333. https://doi.org/10.1016/S0168-9274(98)00100-7