Abstract
A global optimization algorithm for solving bilinear matrix inequalities (BMI) problems is developed. It is based on a dual Lagrange formulation for computing lower bounds that are used in a branching procedure to eliminate partition sets in the space of nonconvex variables. The advantage of the proposed method is twofold. First, lower bound computations reduce to solving easily tractable linear matrix inequality (LMI) problems. Secondly, the lower bounding procedure guarantees global convergence of the algorithm when combined with an exhaustive partitioning of the space of nonconvex variables. Another important feature is that the branching phase takes place in the space of nonconvex variables only, hence limiting the overall cost of the algorithm. Also, an important point in the method is that separated LMI constraints are encapsulated into an augmented BMI for improving the lower bound computations. Applications of the algorithm to robust structure/controller design are considered.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
