Identification in hH∞ via convex programming

Convex programming technique is employed to solve the problem of system identification in H∞ which was first formulated in [6]. A unique feature of this proposed identification algorithm is that it has a performance close to that of Nevanlinna Pick interpolation based algorithm as studied in [1,5] which is strongly optimal within a factor of two. An explicit bound is also derived for the worst case identification error measured in H∞ norm.