No label defined (Q4945444)

An overview of the key developments in the methodological, structural, and computational aspects of the bilinear matrix inequality (BMI) feasibility problem is presented. The connections of the BMI with robust control theory and its geometric properties are discussed, including interpretations of the BMI as a rank-constrained linear matrix inequality (LMI), as an extreme form problem (EFP), and as a semidefinite complementary problem (SDCP). First, the important problem of reformulating the \(\mu/k_m\) synthesis, along with specifications on the controller order and structure, to a BMI is covered. Then the authors proceed to present some of the structural aspects of the BMI. It is shown that the investigations into the geometry of the solution set of the BMI lead to some interesting nonconvex and convex programming problems over cones. In particular, the results pertaining to the equivalence of the BMI with examining the magnitude of the diameter of a certain convex set is discussed. The results connecting the BMI to a class of cone optimization problems, namely, the SDCPs, are also given particular attention. The computational methods for solving the BMI are briefly reviewed in the final section. For the entire collection see [Zbl 0932.00034].