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.

  

Semidefinite programming relaxations and algebraic optimization in Control

Author(s):

P.A. Parrilo, S. Lall
Conference/Journal:

European Journal of Control, vol. 9, no. 2-3, pp. 307-321
Abstract:

We present an overview of the essential elements of semidefinite 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 occurred 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.

Year:

2003
Type of Publication:

(01)Article
Supervisor:



File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@Article { ParLal:2003:IFA_1712,
    author={P.A. Parrilo and S. Lall},
    title={{Semidefinite programming relaxations and algebraic
	  optimization in Control}},
    journal={European Journal of Control},
    year={2003},
    volume={9},
    number={2-3},
    pages={307--321},
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=1712}
}
Permanent link