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...
Asıl Yazarlar: | Garstka, M, Cannon, M, Goulart, P |
---|---|
Materyal Türü: | Conference item |
Dil: | English |
Baskı/Yayın Bilgisi: |
Elsevier
2021
|
Benzer Materyaller
-
Chordal sparsity, decomposing SDPs and the Lyapunov equation
Yazar:: Mason, R, ve diğerleri
Baskı/Yayın Bilgisi: (2014) -
Burer-Monteiro ADMM for large-scale SDPs
Yazar:: Chen, Y, ve diğerleri
Baskı/Yayın Bilgisi: (2023) -
Fast ADMM for homogeneous self-dual embeddings of sparse SDPs
Yazar:: Zheng, Y, ve diğerleri
Baskı/Yayın Bilgisi: (2016) -
On clique convergence of graphs
Yazar:: S.M. Hegde, ve diğerleri
Baskı/Yayın Bilgisi: (2016-12-01) -
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
Yazar:: Napur Patra, ve diğerleri
Baskı/Yayın Bilgisi: (2021-06-01)