interior point methods is really hard for me to follow. Does this method search the optimal from inside of the feasible region polyhedron, where as the simplex algorithm search the surface vertex? What is the time complexity of the interior point method? Is it more efficient than the simplex algorithm?

On the other hand, why don't we use gradient descent or Newton's method for the linear programming problem?