This paper addresses the problem of synthesizing controllers that minimize the l1 norm of the closed loop system subject to performance specifications expressed as linear constraints on the closed loop map. Convex constraints on the closed loop map, such as frequency point magnitude constraints, can be rewritten as an uncountable set of linear constraints. We use a previously derived duality result to approximate the convex constraint by a finite number of linear constraints and we derive bounds on the accuracy of the solutions of the approximate problems. The above mentioned duality result is also the basis for the analysis of the convergence properties of various computational methods.
|Original language||English (US)|
|Number of pages||5|
|Journal||Proceedings of the American Control Conference|
|State||Published - Dec 1 1994|
|Event||Proceedings of the 1994 American Control Conference. Part 1 (of 3) - Baltimore, MD, USA|
Duration: Jun 29 1994 → Jul 1 1994