On the complexity of piecewise affine system identification
Author:
- Fabien LauerFLFabien Lauer
- 1 December 2015
- journal article
- Published by Elsevier in Automatica
- Vol. 62, 148-153
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Precise piecewise affine models from input-output data2014
- Estimating the probability of success of a simple algorithm for switched linear regressionNonlinear Analysis: Hybrid Systems, 2013
- A survey on switched and piecewise affine system identificationIFAC Proceedings Volumes, 2012
- Identification of switched linear systems via sparse optimizationAutomatica, 2011
- A continuous optimization framework for hybrid system identificationAutomatica, 2011
- NP-hardness of Euclidean sum-of-squares clusteringMachine Learning, 2009
- A Bayesian approach to identification of hybrid systemsIEEE Transactions on Automatic Control, 2005
- A bounded-error approach to piecewise affine system identificationIEEE Transactions on Automatic Control, 2005
- A clustering technique for the identification of piecewise affine systemsAutomatica, 2003
- A survey of computational complexity results in systems and controlAutomatica, 2000