Abstract
Abstract This paper investigates the problem of minimizing the l1 norm of the mixed sensitivity matrix [W1S W2T] where IV, and W2 are rational weighting functions, S is the sensitivity function and T= 1–S is the complementary sensitivity function of a discrete-time feedback control system. This problem can be posed as maximization of a function of a finite number of variables with infinitely many constraints. An example is presented which illustrates how an approximate solution to the problem is obtained. Under certain conditions a sequence of truncated problems is solvable. Each problem has a rational solution and a value of l1 norm no greater than the previous problem.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
