Solving Global Optimization Problems with Sparse Polynomials and Unbounded Semialgebraic Feasible Sets