Robust Exact Pole Placement via an LMI-Based Algorithm


This paper deals with the robust exact pole placement problem in connection with the solvability of a Sylvester equation. The main issue is to compute a wellconditioned solution to this equation. The best candidate solution must possess the minimal condition number. This problem is cast as a global optimization under LMI constraints for which a numerical convergent algorithm is provided and compared with the most attractive methods in the literature.

DOI: 10.1109/TAC.2008.2008358

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@article{Rami2009RobustEP, title={Robust Exact Pole Placement via an LMI-Based Algorithm}, author={Mustapha Ait Rami and Samira El Faiz and Abdellah Benzaouia and Fernando Tadeo}, journal={IEEE Trans. Automat. Contr.}, year={2009}, volume={54}, pages={394-398} }