Paper Info
Title
Comments on “Data driven stability analysis of black-box switched linear systems” [Automatica 109 (2019) 108533]
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.
Year
DOI
Venue
2022
10.1016/j.automatica.2022.110412
Automatica
Keywords
DocType
Volume
Learning algorithms,Data-driven verification,Stability,Switched systems,Optimization,Lyapunov methods
Journal
142
ISSN
Citations 
PageRank 
0005-1098
0
0.34
References 
Authors
0
2
Name
Order
Citations
PageRank
Guillaume Berger125.10
Zheming Wang2308.12