We study time-varying semidefinite programs (TV-SDPs), which are whose data (and solutions) functions of time. Our focus is on the setting where vary polynomially with show that under a strict feasibility assumption, restricting solutions to also be polynomial time does not change optimal value TV-SDP. Moreover, by using Positivstellensatz (positive locus theorem) univariate matrices, we best s...