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...
| Autores principales: | , , |
|---|---|
| Formato: | Conference item |
| Lenguaje: | English |
| Publicado: |
Elsevier
2021
|