In this paper we present a procedure for the evaluation of bounds on the parameters of Hammerstein systems, from output measurements affected by bounded errors. The identification problem is formulated in terms of polynomial optimization, and relaxation techniques, based on linear matrix inequalities, are proposed to evaluate parameter bounds by means of convex optimization. The structured sparsity of the formulated identification problem is exploited to reduce the computational complexity of the convex relaxed problem. Analysis of convergence properties and computational complexity is reported.
|Titolo:||Bounded error identification of Hammerstein systems through sparse polynomial optimization|
|Data di pubblicazione:||2012|
|Digital Object Identifier (DOI):||10.1016/j.automatica.2012.06.078|
|Appare nelle tipologie:||1.1 Articolo in rivista|