University of Hertfordshire

By the same authors

Continuous steepest descent path for traversing non-convex regions
Research output: Contribution to journal › Article
Traversing non-convex regions
Research output: Contribution to journal › Article
Differentiating through Conjugate Gradient
Research output: Contribution to journal › Article
Threat Analysis of Software Agents in Online Banking and Payments
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
A comparison of methods for traversing non-convex regions in optimization problems
Research output: Working paper
Simulating Perceptions of Security
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

Research output: Contribution to journal › Article

Michael Bartholomew-Biggs
Salah Beddiaf
Bruce Christianson

Original language	English
Pages (from-to)	1-23
Number of pages	23
Journal	Numerical Algorithms
Early online date	13 Nov 2019
DOIs	https://doi.org/10.1007/s11075-019-00811-w
Publication status	E-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