A global BMI algorithm based on the generalized benders decomposition

We present a new algorithm for the global solution of optimization problems involving bilinear matrix inequalities (BMIs). The method is based on a technique known in large-scale and global optimization as the generalized Benders decomposition. It extends the GOP algorithm of Visweswaran and Floudas for bilinear and biconvex programming to problems with BMI constraints.