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
|
類似資料
-
Chordal sparsity, decomposing SDPs and the Lyapunov equation
著者:: Mason, R, 等
出版事項: (2014) -
Burer-Monteiro ADMM for large-scale SDPs
著者:: Chen, Y, 等
出版事項: (2023) -
Fast ADMM for homogeneous self-dual embeddings of sparse SDPs
著者:: Zheng, Y, 等
出版事項: (2016) -
On clique convergence of graphs
著者:: S.M. Hegde, 等
出版事項: (2016-12-01) -
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
著者:: Napur Patra, 等
出版事項: (2021-06-01)