Now that we have a differentiable assembly operator, we can use to do chordal decomposition by breaking down the large scale sparse SDP constraint into a bunch of small SDP constraints. We still need an equality constraint to specify that the relationship between the large scale sparse matrix K + c * Ksigma == assembleK(Ms) where Ms is the vector of small matrix decision variables of the same size as the element stiffness matrices, i.e. Ms[1] is of size ndofs_per_element x ndofs_per_element. With this formulation, we can then use SDPBarrierAlg of a PercivalAlg to solve the problem efficiently.