Linear Matrix Inequalities
The course is not on the list Without time-table
| Code | Completion | Credits | Range |
|---|---|---|---|
| EP35LMI | ZK | 4 | 2P+2S |
- Garant předmětu:
- Lecturer:
- Tutor:
- Supervisor:
- Department of Control Engineering
- Synopsis:
-
Semidefinite programming or optimization over linear matrix inequalities
(LMIs) is an extension of linear programming to the cone of positive
semidefinite matrices. LMI methods are an important modern tool in systems
control and signal processing.
Theory: Convex sets represented via LMIs; LMI relaxations for solution of
non-convex polynomial optimization problems; Interior-point algorithms to
solve LMI problems; Solvers and software; LMIs for polynomial mehods in
control.
Control applications: robustness analysis of linear and nonlinear systems;
design of fixed-order robust controllers with H-infinity specifications.
For more information, see http://www.laas.fr/~henrion/courses/lmi
- Requirements:
- Syllabus of lectures:
- Syllabus of tutorials:
- Study Objective:
- Study materials:
- Note:
- Further information:
- No time-table has been prepared for this course
- The course is a part of the following study plans: