Global optimization for low-dimensional switching linear regression and bounded-error estimation

From MaRDI portal
Publication:1640233

DOI10.1016/J.AUTOMATICA.2017.11.026zbMATH Open1387.93167arXiv1707.05533OpenAlexW2963722933MaRDI QIDQ1640233FDOQ1640233


Authors: Fabien Lauer Edit this on Wikidata


Publication date: 14 June 2018

Published in: Automatica (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1707.05533




Recommendations




Cites Work


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)