On the Convergence to a Global Solution of Shuffling-Type Gradient Algorithms