This paper develops new relationships between the recently constructed semidefinite programming perfect duality and the earlier perfect duality achieved for linear semi–infinite programming. Applying the linear semi–infinite perfect duality construction to semidefinite programming yields a larger feasible set than the one obtained by the newly constructed semidefinite programming regularized perfect dual.