A clique graph based merging strategy for decomposable SDPs

Chordal decomposition techniques are used to reduce large structured positive semidefinite matrix constraints in semidefinite programs (SDPs). The resulting equivalent problem contains multiple smaller constraints on the nonzero blocks (or cliques) of the original problem matrices. This usually lead...

詳細記述

書誌詳細
主要な著者: Garstka, M, Cannon, M, Goulart, P
フォーマット: Conference item
言語:English
出版事項: Elsevier 2021

類似資料