## SEMIDEFINITE PROGRAMMING RELAXATIONS OF NON-CONVEX PROBLEMS IN CONTROL AND COMBINATORIAL OPTIMIZATION

by
Stephen Boyd
,
Lieven Vandenberghe

Citations: | 18 - 2 self |

### BibTeX

@MISC{Boyd_semidefiniteprogramming,

author = {Stephen Boyd and Lieven Vandenberghe},

title = {SEMIDEFINITE PROGRAMMING RELAXATIONS OF NON-CONVEX PROBLEMS IN CONTROL AND COMBINATORIAL OPTIMIZATION},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

We point out some connections between applications of semidefinite programming in control and in combinatorial optimization. In both fields semidefinite programs arise as convex relaxations of NP-hard quadratic optimization problems. We also show that these relaxations are readily extended to optimization problems over bilinear matrix inequalities.