Identification of switched linear systems via sparse optimization
From MaRDI portal
Publication:534276
DOI10.1016/j.automatica.2011.01.036zbMath1215.93034OpenAlexW1992283848MaRDI QIDQ534276
Publication date: 17 May 2011
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2011.01.036
System identification (93B30) Linear systems in control theory (93C05) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Related Items (30)
Local R-linear convergence of ADMM-based algorithm for \(\ell_1\)-norm minimization with linear and box constraints ⋮ A new kernel-based approach to hybrid system identification ⋮ Global optimization for low-dimensional switching linear regression and bounded-error estimation ⋮ On the complexity of switching linear regression ⋮ Model structure selection for switched NARX system identification: a randomized approach ⋮ Spectral Bayesian estimation for general stochastic hybrid systems ⋮ Rao-blackwellized sampling for batch and recursive Bayesian inference of piecewise affine models ⋮ Identification of hybrid and linear parameter‐varying models via piecewise affine regression using mixed integer programming ⋮ Minimality and identifiability of discrete‐time switched autoregressive exogenous systems ⋮ Identification of switched autoregressive exogenous systems from large noisy datasets ⋮ Expectation maximization based sparse identification of cyberphysical system ⋮ A novel recursive approach for online identification of continuous‐time switched nonlinear systems ⋮ Multimode diagnosis for switched affine systems with noisy measurement ⋮ On the complexity of piecewise affine system identification ⋮ On sparsity‐inducing methods in system identification and state estimation ⋮ Estimation of jump Box-Jenkins models ⋮ On the notion of persistence of excitation for linear switched systems ⋮ New approaches to identification of PWARX systems ⋮ Identification of multiple-mode linear models based on particle swarm optimizer with cyclic network mechanism ⋮ Robust subspace clustering ⋮ Active mode identification and continuous state estimation for switched linear systems with unknown inputs and slow switching signal ⋮ A randomized two-stage iterative method for switched nonlinear systems identification ⋮ An Iterative Algebraic Geometric Approach for Identification of Switched ARX Models with Noise ⋮ Robust and nonlinear control literature survey (No. 25) ⋮ Persistence of excitation for identifying switched linear systems ⋮ A statistical learning perspective on switched linear system identification ⋮ A constrained clustering approach to bounded-error identification of switched and piecewise affine systems ⋮ Set membership identification of switched linear systems with known number of subsystems ⋮ Analysis of a nonsmooth optimization approach to robust estimation ⋮ Adaptive identification of linear systems subject to Gross errors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A recursive identification algorithm for switched linear/affine models
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Recursive identification of switched ARX systems
- Switching in systems and control
- Identification of piecewise affine systems via mixed-integer programming.
- Analysis and synthesis of switched linear control systems
- A clustering technique for the identification of piecewise affine systems
- Identification of hybrid systems. A tutorial
- Identification of piecewise affine systems based on statistical clustering technique
- Identifiability of discrete-time linear switched systems
- Algebraic Identification of MIMO SARX Models
- Highly Robust Error Correction byConvex Programming
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Matrix Analysis
- Sparse Approximate Solutions to Linear Systems
- A Bayesian approach to identification of hybrid systems
- A bounded-error approach to piecewise affine system identification
- A Sparsification Approach to Set Membership Identification of Switched Affine Systems
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Hybrid Systems: Computation and Control
This page was built for publication: Identification of switched linear systems via sparse optimization