Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization