Bounded error identification of Hammerstein systems through sparse polynomial optimization

Authors:
V. Cerone;D. Piga;D. Regruto
Affiliations:
Dipartimento di Automatica e Informatica, Politecnico di Torino, Corso Duca degli Abruzzi 24, I-10129 Torino, Italy;Delft Center for Systems and Control, Delft University of Technology, Mekelweg 2, Delft, 2628 CD, The Netherlands;Dipartimento di Automatica e Informatica, Politecnico di Torino, Corso Duca degli Abruzzi 24, I-10129 Torino, Italy
Venue:
Automatica (Journal of IFAC)
Year:
2012

Citing 11
Cited 0

The identification of nonlinear biological systems: Wiener and Hammerstein cascade models

Biological Cybernetics
Structure identification of nonlinear dynamic systems—a survey on input/output approaches

Automatica (Journal of IFAC)
On nonparametric estimation of nonlinear dynamic systems by the Fourier series estimate

Signal Processing
An optimal two-stage identification algorithm for Hammerstein-Wiener nonlinear systems

Automatica (Journal of IFAC)
Global Optimization with Polynomials and the Problem of Moments

SIAM Journal on Optimization
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity

SIAM Journal on Optimization
Convergent SDP-Relaxations in Polynomial Optimization with Sparsity

SIAM Journal on Optimization
Algorithm 883: SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems

ACM Transactions on Mathematical Software (TOMS)
Brief paper: Computational complexity analysis of set membership identification of Hammerstein and Wiener systems

Automatica (Journal of IFAC)
A blind approach to Hammerstein model identification

IEEE Transactions on Signal Processing
Nonparametric identification of Hammerstein systems

IEEE Transactions on Information Theory

Quantified Score

Hi-index	22.14

Visualization

Abstract

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.