Sequential Convex Overbounding Approximation Method for Bilinear Matrix Inequality Problems

被引：11
|
作者：
Sebe, Noboru [1 ]
机构：
[1] Kyushu Inst Technol, Kitakyushu, Fukuoka, Japan
来源：
IFAC PAPERSONLINE | 2018年 / 51卷 / 25期
关键词：
Bilinear matrix inequality (BMI); convex optimization; semidefinite programming; linear time-invariant system; OUTPUT-FEEDBACK CONTROL; DESIGN; SYSTEMS;
D O I：
10.1016/j.ifacol.2018.11.089
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper concerns with the overbounding method for solving the bilinear matrix inequality (BMI) problem. The overbounding method is essentially the same as the difference of convex optimization approach and the inner approximation method. The unified view of these methods is provided. This paper also proposes a new overbounding algorithm based on the less conservative overbounding approximation and the matrix decomposition. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
引用
收藏
页码：102 / 109
页数：8
相关论文
共 50 条
12345