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...
Prif Awduron: | Garstka, M, Cannon, M, Goulart, P |
---|---|
Fformat: | Conference item |
Iaith: | English |
Cyhoeddwyd: |
Elsevier
2021
|
Eitemau Tebyg
Independent sets in graphs with an excluded clique minor
gan: David R. Wood
Cyhoeddwyd: (2007-01-01)
gan: David R. Wood
Cyhoeddwyd: (2007-01-01)
Eitemau Tebyg
-
Chordal sparsity, decomposing SDPs and the Lyapunov equation
gan: Mason, R, et al.
Cyhoeddwyd: (2014) -
Burer-Monteiro ADMM for large-scale SDPs
gan: Chen, Y, et al.
Cyhoeddwyd: (2023) -
Fast ADMM for homogeneous self-dual embeddings of sparse SDPs
gan: Zheng, Y, et al.
Cyhoeddwyd: (2016) -
On clique convergence of graphs
gan: S.M. Hegde, et al.
Cyhoeddwyd: (2016-12-01) -
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
gan: Napur Patra, et al.
Cyhoeddwyd: (2021-06-01)