An Unregularized Third Order Newton Method

In this paper, we propose a third-order Newton's method which in each iteration solves a semidefinite program as a subproblem. Our approach is based on moving to the local minimum of the third-order Taylor expansion at each iteration, rather than that of the second order. We show that this scheme has local cubic convergence. We then provide numerical experiments comparing this scheme to some standard algorithms.