In general, finding a global minimum of a general non-convex function is an NP-complete problem, and neural network training in particular is NP-complete [Blum and Rivest, 1992].
in the past two years, researchers have finally gained substantial traction in understanding the dynamics of gradient-based optimization of neural networks.