A heuristic approach to solving a class of bilinear matrix inequality problems
β Scribed by Feng Zheng; Qing-Guo Wang; Tong Heng Lee
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 153 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
β¦ Synopsis
Many canonical and modern 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 e ciently 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 ΓΏxed, the overall problem will be reduced to the problem in LMIs. Thus, how to ΓΏnd 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 e ectiveness of the proposed method.
π SIMILAR VOLUMES
The overall methodology developed in this paper can be organized into two major parts. The first part consists of a representation of the Multi-Traveling Salesman Problem as a network circulation model. The second part is a subtour elimination procedure. The circulation-network representation of the
This paper presents a new class of projection and contraction methods for solving monotone variational inequality problems. The methods can be viewed as combinations of some existing projection and contraction methods and the method of shortest residuals, a special case of conjugate gradient methods