Comments on ``Data driven stability analysis of black-box switched linear systems''

Berger, Guillaume;Wang, Zheming
(2022) Automatica — Vol. 142, n° 110412, p. 1-2 (2022)

Files

1-s20-S0005109822002655-main.pdf
  • Open Access
  • Adobe PDF
  • 332.99 KB
  • https://creativecommons.org/licenses/by/4.0/
Download

Details

Authors
Abstract
This item explains a technical problem in the justification of Theorem 10 in Kenanian et al. (2019). The theorem refers to a result in chance-constrained convex programming, but the hypotheses for applying this result are not satisfied since the optimization problem involved in Theorem 10 is nonconvex. However, under an additional mild assumption on the system, the conclusions of Theorem 10 hold, as shown in this item.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Berger, G., & Wang, Z. (2022). Comments on ``Data driven stability analysis of black-box switched linear systems″. Automatica, 142(110412), 1-2. https://doi.org/10.1016/j.automatica.2022.110412 (Original work published 2022)