Chordal decomposition in rank minimized semidefinite programs with applications to subspace clustering
Semidefinite programs (SDPs) often arise in relaxations of some NP-hard problems, and if the solution of the SDP obeys certain rank constraints, the relaxation will be tight. Decomposition methods based on chordal sparsity have already been applied to speed up the solution of sparse SDPs, but method...
Main Authors: | Miller, J, Zheng, Y, Roig-Solvas, B, Sznaier, M, Papachristodoulou, A |
---|---|
Format: | Conference item |
Language: | English |
Published: |
IEEE
2020
|
Similar Items
-
Chordal decomposition in operator-splitting methods for sparse semidefinite programs
by: Zheng, Y, et al.
Published: (2019) -
Chordal and factor-width decompositions for scalable semidefinite and polynomial optimization
by: Zheng, Y, et al.
Published: (2021) -
Fast ADMM for semidefinite programs with chordal sparsity
by: Zheng, Y, et al.
Published: (2017) -
Decomposed structured subsets for semidefinite and sum-of-squares optimization
by: Miller, J, et al.
Published: (2022) -
Scalable design of structured controllers using chordal decomposition
by: Zheng, Y, et al.
Published: (2017)