A Comparison of two Algorithms for the Static H-infinity Loop Shaping Problem

This paper compares two different linear matrix inequality (LMIs) algorithms for the static H-infinityloop shaping synthesis problem. One effective and popular algorithm to solve fixed-order controlproblems is the so-called Cone Complementary Linearization algorithm (CCL). The CCL algorithm isguaranteed to produce, at each iteration, a reduced order controller. The algorithm proposed inthis paper is quite different in its nature as it is based on sufficient, potentiallyconservative, LMI conditions. Our algorithm is compared to the Cone Complementary algorithm on acollection of plants taken from the benchmark library COMPl_eib.The numerical experiments indicate that our algorithm is computationally more attractive and moreefficient than the cone complementary algorithm.