Exploiting sparsity in the coefficient matching conditions in sum-of-squares programming using ADMM
This letter introduces an efficient first-order method based on the alternating direction method of multipliers (ADMM) to solve semidefinite programs arising from sum-of-squares (SOS) programming. We exploit the sparsity of the coefficient matching conditions when SOS programs are formulated in the...
Asıl Yazarlar: | Zheng, Y, Fantuzzi, G, Papachristodoulou, A |
---|---|
Materyal Türü: | Journal article |
Baskı/Yayın Bilgisi: |
IEEE
2017
|
Benzer Materyaller
-
Fast ADMM for sum-of-squares programs using partial orthogonality
Yazar:: Zheng, Y, ve diğerleri
Baskı/Yayın Bilgisi: (2018) -
Fast ADMM for semidefinite programs with chordal sparsity
Yazar:: Zheng, Y, ve diğerleri
Baskı/Yayın Bilgisi: (2017) -
Decomposition and completion of sum-of-squares matrices
Yazar:: Zheng, Y, ve diğerleri
Baskı/Yayın Bilgisi: (2018) -
Sparse sum-of-squares (SOS) optimization: A bridge between DSOS/SDSOS and SOS optimization for sparse polynomials
Yazar:: Zheng, Y, ve diğerleri
Baskı/Yayın Bilgisi: (2019) -
Fast ADMM for homogeneous self-dual embeddings of sparse SDPs
Yazar:: Zheng, Y, ve diğerleri
Baskı/Yayın Bilgisi: (2016)