Global optimization for low-dimensional switching linear regression and bounded-error estimation
DOI10.1016/J.AUTOMATICA.2017.11.026zbMATH Open1387.93167arXiv1707.05533OpenAlexW2963722933MaRDI QIDQ1640233FDOQ1640233
Authors: Fabien Lauer
Publication date: 14 June 2018
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.05533
Recommendations
- Estimating the probability of success of a simple algorithm for switched linear regression
- Bounded error identification of Hammerstein systems through sparse polynomial optimization
- Identification of switched linear systems via sparse optimization
- A continuous optimization framework for hybrid system identification
- A constrained clustering approach to bounded-error identification of switched and piecewise affine systems
Stochastic programming (90C15) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Estimation and detection in stochastic control theory (93E10) Identification in stochastic control theory (93E12) Optimal stochastic control (93E20)
Cites Work
- Identification of hybrid systems. A tutorial
- Analysis of a nonsmooth optimization approach to robust estimation
- Selective <inline-formula> <tex-math notation="TeX">$\ell_{1}$</tex-math></inline-formula> Minimization for Sparse Recovery
- A mathematical introduction to compressive sensing
- Identification of switched linear systems via sparse optimization
- A Sparsification Approach to Set Membership Identification of Switched Affine Systems
- Sparse Approximate Solutions to Linear Systems
- A continuous optimization framework for hybrid system identification
- Identification of piecewise affine systems via mixed-integer programming.
- A Bayesian approach to identification of hybrid systems
- A bounded-error approach to piecewise affine system identification
- Recursive identification of switched ARX systems
- A Difference of Convex Functions Algorithm for Switched Linear Regression
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- The MIN PFS problem and piecewise linear model estimation
- Estimating the probability of success of a simple algorithm for switched linear regression
- On the complexity of switching linear regression
- On the complexity of piecewise affine system identification
Cited In (2)
This page was built for publication: Global optimization for low-dimensional switching linear regression and bounded-error estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1640233)