In this paper, a hybrid descent method, consisting of a simulated annealing algorithm and a gradient-based method, is proposed. The simulated annealing algorithm is used to locate descent points for previously converged local minima. The combined method has the descent property and the convergence is monotonic. To demonstrate the effectiveness of the proposed hybrid descent method, several multi-dimensional non-convex optimization problems are solved. Numerical examples show that global minimum can be sought via this hybrid descent method.
CITATION STYLE
Yiu, K. F. C., Liu, Y., & Teo, K. L. (2004). A hybrid descent method for global optimization. Journal of Global Optimization, 28(2), 229–238. https://doi.org/10.1023/B:JOGO.0000015313.93974.b0
Mendeley helps you to discover research relevant for your work.