A comparison of methods for traversing regions of non-convexity in optimization problems
View/ Open
Author
Bartholomew-Biggs, Michael
Beddiaf, Salah
Christianson, Bruce
Attention
2299/22053
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.
Publication date
2019-11-13Published in
Numerical AlgorithmsPublished version
https://doi.org/10.1007/s11075-019-00811-wOther links
http://hdl.handle.net/2299/22053Metadata
Show full item recordRelated items
Showing items related by title, author, creator and subject.
-
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 ... -
Sequential multiple methods as a contemporary method in learning disability nursing practice research.
Mafuba, Kay; Gates, Robert (2012-12)This paper explores and advocates the use of sequential multiple methods as a contemporary strategy for undertaking research. Sequential multiple methods involve the use of results obtained through one data collection ...