Reduced LMIs for Fixed-Order Polynomial Controller Design
2004 (English)In: Proceedings of the 16th International Symposium on Mathematical Theory of Networks and Systems, 2004Conference paper (Refereed)
A reduction procedure based on semidefinite programming duality is applied to LMI conditions for fixed-order scalar linear controller design in the polynomial framework. It is namely shown that the number of variables in the reduced design LMI is equal to the difference between the open-loop plant order and the desired controller order. A standard linear system of equations must then be solved to retrieve the controller parameters. Therefore high computational load is not necessarily expected when the number of controller parameters is large, but rather when a large number of plant parameters are to be controlled with a small number of controller paramters. Tailored interior-point algorithms dealing with the specific structure of the reduced design LMI are also discussed.
Place, publisher, year, edition, pages
Linear systems, Fixed-order controller design, Polynomials, Linear matrix inequalities (LMI), Semidefinite programming (SDP), Interior-point methods
Engineering and Technology Control Engineering
IdentifiersURN: urn:nbn:se:liu:diva-24078Local ID: 3640ISBN: 9056825178OAI: oai:DiVA.org:liu-24078DiVA: diva2:244394
16th International Symposium on Mathematical Theory of Networks and Systems, Leuven, Belgium, July, 2004