A new Lagrangian dual global optimization algorithm for solving bilinear matrix inequalities
✍ Scribed by H. D. Tuan; P. Apkarian; Y. Nakashima
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 202 KB
- Volume
- 10
- Category
- Article
- ISSN
- 1049-8923
No coin nor oath required. For personal study only.
✦ Synopsis
A new 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 complicating variables. The advantage of the proposed method is twofold. First, the 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 complicating variables. A rigorous proof of this fact is provided. Another important feature is that the branching phase takes place in the space of complicating 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.