A comparison of methods for traversing regions of non-convexity in optimization problems

This paper considers the well-known problem of dealing with non-convexity during the minimization of a non-linear function f ( x ) by Newton-like methods. The proposal made here involves a curvilinear search along an approximation to the continuous steepest descent path defined by the solution of the differential equation The algorithm we develop and describe has some features in common with trust-region methods and we present some numerical experiments in which its performance is compared with other ODE-based and trust-region methods.