Decomposition and completion of sum-of-squares matrices
This paper introduces a notion of decomposition and completion of sum-of-squares (SOS) matrices. We show that a subset of sparse SOS matrices with chordal sparsity patterns can be equivalently decomposed into a sum of multiple SOS matrices that are nonzero only on a principal submatrix. Also, the co...
Autors principals: | Zheng, Y, Fantuzzi, G, Papachristodoulou, A |
---|---|
Format: | Journal article |
Publicat: |
2018
|
Ítems similars
-
Fast ADMM for sum-of-squares programs using partial orthogonality
per: Zheng, Y, et al.
Publicat: (2018) -
Exploiting sparsity in the coefficient matching conditions in sum-of-squares programming using ADMM
per: Zheng, Y, et al.
Publicat: (2017) -
Block factor-width-two matrices and their applications to semidefinite and sum-of-squares optimization
per: Zheng, Y, et al.
Publicat: (2022) -
Sparse sum-of-squares (SOS) optimization: A bridge between DSOS/SDSOS and SOS optimization for sparse polynomials
per: Zheng, Y, et al.
Publicat: (2019) -
On the construction of Lyapunov functions using the sum of squares decomposition
per: Papachristodoulou, A, et al.
Publicat: (2002)