Sequential convex relaxation for convex optimization with bilinear matrix equalities
We consider the use of the nuclear norm operator, and its tendency to produce low rank results, to provide a convex relaxation of Bilinear Matrix Inequalities (BMIs) The BMI is first written as a Linear Matrix Inequality (LMI) subject to a bi affine equality constraint and subsequently rewritten into an LMI subject to a rank constraint on a matrix affine in the decision variables. The convex nuclear norm operator is used to relax this rank constraint. We provide an algorithm that iteratively improves on the sum of the objective function and the norm of the equality constraint violation. The algorithm is demonstrated on a controller synthesis example.
2016 European Control Conference (ECC)