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.
Published inNumerical Algorithms
MetadataShow full item record
Showing items related by title, author, creator and subject.
Beddiaf, Salah (2016-05-12)In this thesis, we investigate methods of finding a local minimum for unconstrained problems of non-convex functions with n variables, by following the solution curve of a system of ordinary differential equations. The ...
Hocking, Alex; Geach, James E.; Sun, Yi; Davey, Neil (2017-09-15)We present an unsupervised machine learning technique that automatically segments and labels galaxies in astronomical imaging surveys using only pixel data. Distinct from previous unsupervised machine learning approaches ...
A stepwise neuron model fitting procedure designed for recordings with high spatial resolution : Application to layer 5 pyramidal cells Mäki-Marttunen, Tuomo; Halnes, Geir; Devor, Anna; Metzner, Christoph; Dale, Anders M.; Andreassen, Ole A.; Einevoll, Gaute T. (2018-01-01)Background Recent progress in electrophysiological and optical methods for neuronal recordings provides vast amounts of high-resolution data. In parallel, the development of computer technology has allowed simulation of ...