By Topic

A Convex Optimization Approach to Synthesizing Bounded Complexity \ell ^{\infty } Filters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Franco Blanchini ; Dept. of Math. & Comput. Sci., Univ. of Udine, Udine, Italy ; Mario Sznaier

We consider the worst-case estimation problem in the presence of unknown but bounded noise. Contrary to stochastic approaches, the goal here is to confine the estimation error within a bounded set. Previous work dealing with the problem has shown that the complexity of estimators based upon the idea of constructing the state consistency set (e.g., the set of all states consistent with the a priori information and experimental data) cannot be bounded a priori, and can, in principle, continuously increase with time. To avoid this difficulty we propose a class of bounded complexity filters, based upon the idea of confining r-length error sequences (rather than states) to hyperrectangles. The main result of the technical note shows that this can be accomplished by using linear time invariant filters of order no larger than r. Further, synthesizing these filters reduces to a combination of convex optimization and line search.

Published in:

IEEE Transactions on Automatic Control  (Volume:57 ,  Issue: 1 )