Bounded error identification of Hammerstein systems through sparse polynomial optimization
From MaRDI portal
Publication:361063
DOI10.1016/j.automatica.2012.06.078zbMath1271.93161OpenAlexW2042427291MaRDI QIDQ361063
Dario Piga, Diego Regruto, Vito Cerone
Publication date: 28 August 2013
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: http://eprints.imtlucca.it/2468/1/Aut2012PigaPreprint.pdf
Related Items
Set-membership errors-in-variables identification of MIMO linear systems ⋮ A linear programming approach to online set membership parameter estimation for linear regression models ⋮ One-shot set-membership identification of generalized Hammerstein-Wiener systems ⋮ A novel APSO-aided weighted LSSVM method for nonlinear Hammerstein system identification ⋮ A bias-corrected estimator for nonlinear systems with output-error type model structures ⋮ A nonlinear recursive instrumental variables identification method of Hammerstein ARMAX system
Uses Software
Cites Work
- Enforcing stability constraints in set-membership identification of linear dynamic systems
- On nonparametric estimation of nonlinear dynamic systems by the Fourier series estimate
- Block-oriented nonlinear system identification
- The identification of nonlinear biological systems: Wiener and Hammerstein Cascade models
- An optimal two-stage identification algorithm for Hammerstein-Wiener nonlinear systems
- Identificaction of nonlinear block-oriented systems by the recursive kernel estimate
- Computational complexity analysis of set membership identification of Hammerstein and Wiener systems
- Structure identification of nonlinear dynamic systems - A survey on input/output approaches
- Global Optimization with Polynomials and the Problem of Moments
- Nonparametric identification of Hammerstein systems
- Identifying MIMO Hammerstein systems in the context of subspace model identification methods
- Parameter bounds for discrete-time hammerstein models with bounded output errors
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
