Abstract
In this paper, the robust (weighted) H <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</sub> filtering and feedback control problems are considered in the case of time variant and time invariant uncertainties. Using a separation of graph theorem with the scalings/multipliers approach, solutions to these problems can be proposed as an infinite dimensional convex optimization problem. The main result is to prove that in both cases and for both problems, both infinite dimensional convex optimization problems can be converted into finite dimensional convex optimization problem involving linear matrix inequality (LMI) constraints which is an extension of previously published results of Giusto and Paganini (1999)
Published Version
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