Global optimization for low-dimensional switching linear regression and bounded-error estimation
From MaRDI portal
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)
Abstract: The paper provides global optimization algorithms for two particularly difficult nonconvex problems raised by hybrid system identification: switching linear regression and bounded-error estimation. While most works focus on local optimization heuristics without global optimality guarantees or with guarantees valid only under restrictive conditions, the proposed approach always yields a solution with a certificate of global optimality. This approach relies on a branch-and-bound strategy for which we devise lower bounds that can be efficiently computed. In order to obtain scalable algorithms with respect to the number of data, we directly optimize the model parameters in a continuous optimization setting without involving integer variables. Numerical experiments show that the proposed algorithms offer a higher accuracy than convex relaxations with a reasonable computational burden for hybrid system identification. In addition, we discuss how bounded-error estimation is related to robust estimation in the presence of outliers and exact recovery under sparse noise, for which we also obtain promising numerical results.
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
Cites work
- A Bayesian approach to identification of hybrid systems
- A Difference of Convex Functions Algorithm for Switched Linear Regression
- A Sparsification Approach to Set Membership Identification of Switched Affine Systems
- A bounded-error approach to piecewise affine system identification
- A continuous optimization framework for hybrid system identification
- A mathematical introduction to compressive sensing
- Analysis of a nonsmooth optimization approach to robust estimation
- Estimating the probability of success of a simple algorithm for switched linear regression
- Identification of hybrid systems. A tutorial
- Identification of piecewise affine systems via mixed-integer programming.
- Identification of switched linear systems via sparse optimization
- On the complexity of piecewise affine system identification
- On the complexity of switching linear regression
- Recursive identification of switched ARX systems
- Selective <inline-formula> <tex-math notation="TeX">$\ell_{1}$</tex-math></inline-formula> Minimization for Sparse Recovery
- Sparse Approximate Solutions to Linear Systems
- The MIN PFS problem and piecewise linear model estimation
- The complexity and approximability of finding maximum feasible subsystems of linear relations
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)
