By Topic

Low nonconvexity-rank bilinear matrix inequalities: algorithms and applications in robust controller and structure designs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Tuan, H.D. ; Dept. of Control & Inf., Toyota Inst. of Technol., Nagoya, Japan ; Apkarian, P.

A branch and bound (BB) algorithm for solving a general class of bilinear matrix inequality (BMI) problems is proposed. First, linear matrix inequality (LMI) constraints are incorporated into BMI constraints in a special way to take advantage of useful information on nonconvex terms. Then, the nonconvexity of the BMI is centralized in coupling constraints so that when the latter are omitted, we get a relaxed LMI problem for computing lower bounds. As in our previous developments, the branching is performed in a reduced dimensional space of complicating variables. This makes the approach practical even with a large dimension of overall variables. Applications of the algorithm to several test problems of robust control are discussed.

Published in:

Automatic Control, IEEE Transactions on  (Volume:45 ,  Issue: 11 )