Rank minimization approach for solving BMI problems with random search

Presents the rank minimization approach to solve general bilinear matrix inequality (BMI) problems. Due to the NP-hardness of BMI problems, no proposed algorithm that globally solves general BMI problems is a polynomial-time algorithm. We present a local search algorithm based on the semidefinite programming relaxation approach to indefinite quadratic programming, which is analogous to the well-known relaxation method for a certain-class of combinatorial problems. Instead of applying the branch and bound method for global search, a linearization-based local search algorithm is employed to reduce the relaxation gap. Furthermore, a random search approach is introduced along with the deterministic approach. Four numerical experiments are presented to show the search performance of the proposed approach.

[1]  P. Khargonekar,et al.  Mixed H/sub 2//H/sub infinity / control: a convex optimization approach , 1991 .

[2]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[3]  K. Goh,et al.  Control system synthesis via bilinear matrix inequalities , 1994, Proceedings of 1994 American Control Conference - ACC '94.

[4]  G. Papavassilopoulos,et al.  A global optimization approach for the BMI problem , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[5]  P. Gahinet,et al.  A linear matrix inequality approach to H∞ control , 1994 .

[6]  O. Toker,et al.  On the NP-hardness of solving bilinear matrix inequalities and simultaneous stabilization with static output feedback , 1995, Proceedings of 1995 American Control Conference - ACC'95.

[7]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[8]  R. Nikoukhah,et al.  LMITOOL: a package for LMI optimization , 1995, Proceedings of 1995 34th IEEE Conference on Decision and Control.

[9]  George P. Papavassilopoulos,et al.  Numerical Experience with Parallel Algorithms for Solving the BMI Problem , 1996 .

[10]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[11]  L. Ghaoui,et al.  A cone complementarity linearization algorithm for static output-feedback and related problems , 1996, Proceedings of Joint Conference on Control Applications Intelligent Control and Computer Aided Control System Design.

[12]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

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

[14]  Mario A. Rotea,et al.  Fixed-order scaled ℋ∞ synthesis , 1997 .

[15]  David R. Karger,et al.  Approximate graph coloring by semidefinite programming , 1998, JACM.

[16]  Mehran Mesbahi,et al.  On the semi-definite programming solution of the least order dynamic output feedback synthesis , 1999, Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251).

[17]  Stephen P. Boyd,et al.  A path-following method for solving BMI problems in control , 1999, Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251).

[18]  H. Tuy,et al.  D.C. optimization approach to robust control: Feasibility problems , 2000 .

[19]  E. Feron,et al.  Resolution of Conflicts Involving Many Aircraft via Semidefinite Programming , 2001 .