Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


Automatic robust convex programming

A considerable amount of optimization problems arising in the control and systems theory field can be seen as special instances of robust optimization. Much of the modeling effort in these cases is spent on converting an uncertain problem to a robust counterpart without uncertainty. Since many of these conversions follow standard procedures, it is amenable to software support. This talk presents the robust optimization framework in the modeling language YALMIP, which carries out the uncertainty elimination automatically and allows the user to concentrate on the high-level model instead.
Type of Seminar:
Optimization and Applications Seminar
Dr. Johan Loefberg
Linkoeping University
Mar 15, 2010   16:30

HG G 19.1, Rämistrasse 101
Contact Person:

Prof. J. Lygeros
File Download:

Request a copy of this publication.
Biographical Sketch: