Title
Identification in H∞ via convex programming
Document Type
Conference Proceeding
Publication Date
12-1-1993
Abstract
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.
Publication Source (Journal or Book title)
American Control Conference
First Page
1537
Last Page
1538
Recommended Citation
Xiong, D., Gu, G., & Zhou, K. (1993). Identification in H∞ via convex programming. American Control Conference, 1537-1538. Retrieved from https://repository.lsu.edu/eecs_pubs/385