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
RelationsSchool of Physics, Astronomy and Mathematics
MetadataShow full item record
Showing items related by title, author, creator and subject.
Diedrichsen, J. (University of Hertfordshire, 1995)An indication of the attractiveness of the object-oriented idea can be obtained by looking at the hype around this popular approach to software engineering which was and, in many cases still is, created by both the academic ...
Coupled Cooling Method and Application of Latent Heat Thermal Energy Storage Combined with Pre-cooling of Envelope: Method and Model development Yuan, Y; Gao, X; Wu, Hongwei; Zhang, Z; Cao, X; Yu, N; Sun, Liangliang (2017-01-15)The traditional cooling methods cannot meet the requirements of safety, stability, reliability and no-power at the same time under some special circumstances. In this study, a new coupled cooling method of Latent Heat ...