## Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization (1998)

by
Steven J. Benson
,
Yinyu Ye
,
Xiong Zhang

Venue: | SIAM JOURNAL ON OPTIMIZATION |

Citations: | 113 - 11 self |

### BibTeX

@ARTICLE{Benson98solvinglarge-scale,

author = {Steven J. Benson and Yinyu Ye and Xiong Zhang},

title = {Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization},

journal = {SIAM JOURNAL ON OPTIMIZATION},

year = {1998},

volume = {10},

pages = {443--461}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present a dual-scaling interior-point algorithm and show how it exploits the structure and sparsity of some large scale problems. We solve the positive semidefinite relaxation of combinatorial and quadratic optimization problems subject to boolean constraints. We report the first computational results of interior-point algorithms for approximating the maximum cut semidefinite programs with dimension up-to 3000.