No label defined (Q4945435)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1424228
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1424228 |
Statements
22 October 2000
0 references
integral quadratic constraints
0 references
multiplier computation
0 references
robustness
0 references
convex optimization
0 references
linear matrix inequalities
0 references
0 references
0.94427305
0 references
0.93892056
0 references
0.9194535
0 references
0 references
0.9127439
0 references
The authors give a format for multiplier computation in robustness analysis. It is applicable to a large class of systems. The resulting computational problem can be formulated as a convex optimization problem in terms of Linear Matrix Inequalities (LMIs). It is easy to implement the ideas in terms of a set of subroutines that interfaces any of the existing software packages for solving convex optimization problems in terms of LMIs. Two numerical examples that verify the applicability of the suggested method for multiplier computation are given. For the entire collection see [Zbl 0932.00034].
0 references
