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