Erratum to "Edge Selections in Bilinear Dynamic Networks"

Lemma 2 of "Edge Selections in Bilinear Dynamical Networks" (Oliveira et al., 2024) allows one to efficiently compute a lower bound for the optimal <inline-formula><tex-math notation="LaTeX">\mathcal {H}_{2}</tex-math></inline-formula>-norm of a bilinear d...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on automatic control Jg. 70; H. 1; S. 705 - 706
Hauptverfasser: de Oliveira, Arthur Castello B., Siami, Milad, Sontag, Eduardo D.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.01.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Greedy algorithms
Networked control systems
Nonlinear systems
Optimization
Robustness
ISSN:0018-9286, 1558-2523
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Lemma 2 of "Edge Selections in Bilinear Dynamical Networks" (Oliveira et al., 2024) allows one to efficiently compute a lower bound for the optimal <inline-formula><tex-math notation="LaTeX">\mathcal {H}_{2}</tex-math></inline-formula>-norm of a bilinear dynamical network following optimal edge selection, by showing convexity of a relaxed version of the problem. However, the proof presented is wrong in general, leaving the statement unproven. In this note, we discuss a case in which the presented result is guaranteed to hold and update our experimental results in light of this fact. Despite this problem with an auxiliary result in the article, notice that the main result in Theorem 1 remains correct, proving supermodularity of the <inline-formula><tex-math notation="LaTeX">\mathcal {H}_{2}</tex-math></inline-formula>-norm under edge addition.
Bibliographie:ObjectType-Correction/Retraction-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2024.3496575