Identification of switched linear systems via sparse optimization
Author:
- Laurent BakoLBLaurent Bako
- 1 April 2011
- journal article
- Published by Elsevier in Automatica
- Vol. 47 (4) , 668-677
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and ImagesSIAM Review, 2009
- Recursive identification of switched ARX systemsAutomatica, 2008
- Identification of Hybrid Systems A TutorialEuropean Journal of Control, 2007
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- Identification of piecewise affine systems based on statistical clustering techniqueAutomatica, 2005
- Identification of piecewise affine systems via mixed-integer programmingAutomatica, 2004
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimizationProceedings of the National Academy of Sciences, 2003
- A clustering technique for the identification of piecewise affine systemsAutomatica, 2003
- Observability and identifiability of jump linear systems2002
- Sparse Approximate Solutions to Linear SystemsSIAM Journal on Computing, 1995