A convex relaxation approach to set-membership identification of LPV systems
From MaRDI portal
Publication:2628501
DOI10.1016/j.automatica.2013.05.028zbMath1364.93824OpenAlexW2047876668MaRDI QIDQ2628501
Dario Piga, Diego Regruto, Vito Cerone
Publication date: 2 June 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: http://eprints.imtlucca.it/2473/1/Aut2013PigaPreprint.pdf
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Control/observation systems with incomplete information (93C41) Linear systems in control theory (93C05) Identification in stochastic control theory (93E12)
Related Items (5)
A convex relaxation approach to set-membership identification of LPV systems ⋮ Set-membership errors-in-variables identification of MIMO linear systems ⋮ LPV system identification under noise corrupted scheduling and output signal observations ⋮ A linear programming approach to online set membership parameter estimation for linear regression models ⋮ Towards efficient maximum likelihood estimation of LPV-SS models
Cites Work
- Unnamed Item
- Unnamed Item
- Set-membership LPV model identification of vehicle lateral dynamics
- Modeling and identification of linear parameter-varying systems
- Subspace identification of multivariable linear parameter-varying systems
- Asymptotically optimal orthonormal basis functions for LPV system identification
- Subspace identification of MIMO LPV systems using a periodic scheduling sequence
- Optimal worst case estimation for LPV--FIR models with bounded errors
- A convex relaxation approach to set-membership identification of LPV systems
- Identification of linear parameter varying models
- Subspace identification of linear parameter-varying systems with innovation-type noise models driven by general inputs and a measurable white noise time-varying parameter vector
- Identification of linear parameter-varying state-space models with application to helicopter rotor dynamics
- Identification of non-linear parametrically varying models using separable least squares
- An LMI approach to control-oriented identification and model (In)validation of LPV systems
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Research on gain scheduling
This page was built for publication: A convex relaxation approach to set-membership identification of LPV systems