University of Hertfordshire

By the same authors

View graph of relations
Original languageEnglish
Pages (from-to)1-23
Number of pages23
JournalNumerical Algorithms
Early online date13 Nov 2019
DOIs
Publication statusE-pub ahead of print - 13 Nov 2019

Abstract

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.

Notes

© Springer Science+Business Media, LLC, part of Springer Nature 2019. This is a post-peer-review, pre-copyedit version of an article published in Numerical Algorithms. The final authenticated version is available online at: http://dx.doi.org/10.1007/s11075-019-00811-w.

ID: 17419250