LMI approximations for the radius of the intersection of ellipsoids: Survey. (Q5929424)
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 1585023
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LMI approximations for the radius of the intersection of ellipsoids: Survey. |
scientific article; zbMATH DE number 1585023 |
Statements
LMI approximations for the radius of the intersection of ellipsoids: Survey. (English)
0 references
4 April 2001
0 references
This paper surveys various linear matrix inequality relaxation techniques for evaluating the maximum norm vector within the intersection of several ellipsoids. This difficult nonconvex optimization problem arises frequently in robust control synthesis. Two randomized algorithms and several ellipsoidal approximations are described. Guaranteed approximation bounds are derived in order to evaluate the quality of these relaxations.
0 references
convex relaxations
0 references
linear matrix inequality relaxation
0 references
maximum norm vector
0 references
ellipsoids
0 references
nonconvex optimization
0 references
robust control synthesis
0 references
0 references
0.7718057036399841
0 references
0.7545340657234192
0 references
0.7530263066291809
0 references
