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 well-conditioned 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.