A heuristic approach to solving a class of bilinear matrix inequality problems

被引:25
|
作者
Zheng, F [1 ]
Wang, QG [1 ]
Lee, TH [1 ]
机构
[1] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore 119260, Singapore
关键词
bilinear matrix inequalities; overshoot bound control; reachable set analysis;
D O I
10.1016/S0167-6911(02)00181-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many canonical and modem control problems can be recast into the problem of a group of matrix inequalities. Some of them are in the form of linear matrix inequalities (LMIs), which can be solved very efficiently by the powerful LMI toolbox in Matlab, but some others are in the form of bilinear matrix inequalities. The characteristic of this latter class of problems is that when the so called "communicating variables" are fixed, the overall problem will be reduced to the problem in LMIs. Thus, how to find the communicating variables is the key to solve the whole problem. In this paper, an optimal estimate for the communicating variables is presented. We will illustrate our method by completely solving the problems of overshoot bound control and reachable set analysis for uncertain systems. Numerical examples are provided to show the effectiveness of the proposed method. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:111 / 119
页数:9
相关论文
共 50 条
  • [1] Solving a class of matrix minimization problems by linear variational inequality approaches
    Tao, Min
    Yuan, Xiao-ming
    He, Bing-sheng
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2011, 434 (11) : 2343 - 2352
  • [2] A mesh-based partitioning algorithm for decreasing conservatism in solving bilinear matrix inequality problems
    Javanmardi, Hamidreza
    Dehghani, Maryam
    Mohammadi, Mohsen
    Hesamzadeh, Mohammad Reza
    [J]. OPTIMAL CONTROL APPLICATIONS & METHODS, 2023, 44 (05): : 2571 - 2594
  • [3] Search Direction in Successive Linearization of Bilinear Matrix Inequality Problems
    Okayama, Tomoki
    Sebe, Noboru
    [J]. 2018 INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY ROBOTICS (ICT-ROBOT), 2018,
  • [4] A HEURISTIC APPROACH TO SOLVING TRAVELING SALESMAN PROBLEMS
    KARG, RL
    THOMPSON, GL
    [J]. MANAGEMENT SCIENCE, 1964, 10 (02) : 225 - 248
  • [5] A HEURISTIC APPROACH TO SOLVING COMPLEX LITIGATION PROBLEMS
    Oxhorn, Melanie L.
    [J]. UNIVERSITY OF CINCINNATI LAW REVIEW, 2024, 92 (03)
  • [6] EVALUATION OF A HEURISTIC APPROACH TO SOLVING CHILDRENS PROBLEMS
    CANTRELL, RP
    CANTRELL, ML
    [J]. PEABODY JOURNAL OF EDUCATION, 1977, 54 (03): : 168 - 173
  • [7] A bilinear matrix inequality approach to robust nonlinear process control
    Togkalidou, T
    Braatz, RD
    [J]. PROCEEDINGS OF THE 2000 AMERICAN CONTROL CONFERENCE, VOLS 1-6, 2000, : 3229 - 3233
  • [8] Linear Matrix Inequality Method for a Quadratic Performance Index Minimization Problem with a class of Bilinear Matrix Inequality Conditions
    Tanemura, M.
    Chida, Y.
    [J]. 13TH INTERNATIONAL CONFERENCE ON MOTION AND VIBRATION CONTROL (MOVIC 2016) AND THE 12TH INTERNATIONAL CONFERENCE ON RECENT ADVANCES IN STRUCTURAL DYNAMICS (RASD 2016), 2016, 744
  • [9] Analog circuits for solving a class of variational inequality problems
    Zhao, You
    He, Xing
    Huang, Tingwen
    Han, Qi
    [J]. NEUROCOMPUTING, 2018, 295 : 142 - 152
  • [10] Sequential Convex Overbounding Approximation Method for Bilinear Matrix Inequality Problems
    Sebe, Noboru
    [J]. IFAC PAPERSONLINE, 2018, 51 (25): : 102 - 109