How to determine whether an intersection of a convex polytope and a simplex in $R^{n}$ is not empty?

The polytope is given in a halfspace representation.

I'm aware that there are some algorithms which work in $R^{2}$ and $R^{3}$, but I don't know any that would work in $R^{n}.$