BMI Global Optimization using Parallel Branch and Bound Method with a Novel Branching Method

This paper deals with the global optimization of the BMIEP (bilinear matrix inequalities eigenvalue problem) based on a parallel branch and bound method. First, a novel branching rule considering BMI structure is proposed for both serial and parallel algorithms. Comparing the proposed branching rule with conventional ones, we confirm the effectiveness of the new branching method. Then, based on a master-worker method, a parallelized branch and bound algorithm is designed and implemented on a Beowulf cluster system. The computational granularity is an important factor for the efficiency of parallel algorithms. The developed parallel algorithm makes the computational granularity variable. The effectiveness of the maximal granularity parameter optimization is numerically studied. Finally, a low-order Hinfin controller design problem is solved to demonstrate the viability of both the developed algorithm and the implemented software.

[1]  H. Fujioka,et al.  Bounds for the BMI Eigenvalue Problem:A Good Lower Bound and A Cheap Upper Bound , 1997 .

[2]  Stephen P. Boyd,et al.  A global BMI algorithm based on the generalized benders decomposition , 1997, 1997 European Control Conference (ECC).

[3]  Karolos M. Grigoriadis,et al.  Fixed-order control design for LMI control problems using alternating projection methods , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[4]  Masakazu Kojima,et al.  Branch-and-Cut Algorithms for the Bilinear Matrix Inequality Eigenvalue Problem , 2001, Comput. Optim. Appl..

[5]  H. Fujioka,et al.  Bounds for the BMI Eigenvalue Problem , 1997 .

[6]  Pierre Apkarian,et al.  Low nonconvexity-rank bilinear matrix inequalities: algorithms and applications in robust controller and structure designs , 2000, IEEE Trans. Autom. Control..

[7]  Masakazu Kojima,et al.  Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) , 2003, Optim. Methods Softw..

[8]  Eric Bengt Beran,et al.  Methods for Optimization-based Fixed-Order Control Design , 1997 .

[9]  Michael G. Safonov,et al.  Global optimization for the Biaffine Matrix Inequality problem , 1995, J. Glob. Optim..

[10]  Karolos M. Grigoriadis,et al.  Low-order control design for LMI problems using alternating projection methods , 1996, Autom..

[11]  Kento Aida,et al.  Distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[12]  S. Bhattacharyya,et al.  Robust control with structure perturbations , 1988 .

[13]  S. Bhattacharyya,et al.  Robust control with structured perturbations , 1987, 26th IEEE Conference on Decision and Control.

[14]  Kento Aida,et al.  High-performance parallel and distributed computing for the BMI eigenvalue problem , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.