  In this paper, we prove that every SONC polynomial decomposes into a sum of
nonnegative circuit polynomials with the same support, which reveals the
advantage of SONC decompositions for certifying nonnegativity of sparse
polynomials compared with the classical SOS decompositions. By virtue of this
fact, we can decide $f\in$ SONC through relative entropy programming more
efficiently.
