Semidefinite programming relaxations and algebraic optimization in control

Abstract

We present an overview of the essential elements of semideflnite programming as a computational tool for the analysis of systems and control problems. We make particular emphasis on general duality properties as providing suboptimality or infeasibility certificates. Our focus is on the exciting developments which have occured in the last few years, including robust optimization, combinatorial optimization, and algebraic methods such as sum-of-squares. These developments are illustrated with examples of applications to control systems. © 2003 EUCA.