DocumentCode :
490351
Title :
Identification in hH via convex programming
Author :
Xiong, Dapeng ; Gu, Guoxiang ; Zhou, Kemin
Author_Institution :
Department of Electrical and Computer Engineering, Louisiana State University
fYear :
1993
fDate :
2-4 June 1993
Firstpage :
1537
Lastpage :
1538
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.
Keywords :
Algorithm design and analysis; Constraint optimization; Frequency response; Gold; Interpolation; Noise level; Performance analysis; Stability; Surface-mount technology; Virtual private networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
American Control Conference, 1993
Conference_Location :
San Francisco, CA, USA
Print_ISBN :
0-7803-0860-3
Type :
conf
Filename :
4793129
Link To Document :
بازگشت