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...

Disgrifiad llawn

Manylion Llyfryddiaeth
Prif Awduron: Garstka, M, Cannon, M, Goulart, P
Fformat: Conference item
Iaith:English
Cyhoeddwyd: Elsevier 2021

Eitemau Tebyg