Abstract
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.
Similar content being viewed by others
References
Bagirov, A. and Rubinov, A. (2003), Cutting angle method and a local search. Journal of Global Optimization 27, 193–213.
Barhen, J., Protopopescu, V. and Reister, D. (1997), TRUST: A deterministic algorithm for global optimization, Science, 276, 1094–1097.
Cerny, V. (1985), Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm, Journal of Optimization Theory and Applications 45, 41–51.
Cetin, B., Barhen, J. and Burdick, J. (1993), Terminal repeller unconstarined subenergy tunneling (TRUST) for fast global optimization, Journal of Optimization and Applications 77, 97–126.
Ge, R. (1987), The theory of filled function method for finding global minimizers of nonlinearly constrained minimization problems, Journal of Computational Mathematics 5(1), 1–9.
Ge, R. (1990), A filled function method for finding a global minimizer of a function of several variables, Mathematical Programming 46, 191–204.
Ge, R. and Qin, Y. (1987), A class of filled functions for finding global minimizers of a function of several variables, Journal of Optimization Theory and Applications 52(2), 240–252.
Griewank, A. (1981), Generalized descent for global optimization, Journal of Optimization Theory and Applications 34, 11–39.
Kirkpatrick, S. Jr., C. D. G. and Vecchi, M. P. (1983), Optimization by simulated annealing, Science, 220: 671–680.
Levy, A. and Montalvo, A. (1985), The tunneling algorithm for the global minimization of functions, SIAM Journal of Scientific and Statistical Computing 6, 15–29.
Liu, X. (2001), Finding global minima with a computable filled function, Journal of Global Optimization, 19, 151–161.
Liu, Y. and Teo, K. (1999), A bridging method for global optimization, Journal of Australian Mathematical Society Series B 41, 41–57.
Locatelli, M. (2000), Simulated annealing algorithms for continuous global optimization: convergence conditions, Journal of Optimization Theory and Applications, 104(1), 121–133.
Ng, C. and Li, D. (2001), A sequential constrained minimization method for constrained global optimization. In: Proceedings of the 5th International Conference on Optimization: Techniques and Applications, Hong Kong, pp. 990–997.
Pardalos, P., Ye, Y. and Han, C. (1991), Algorithms for the solution of quadratic knapsack problems, Linear Algebra and its Applications 152, 69–91.
Press, W., Teukolsky, S., Vetterling, W. and Flannery, B. (1992), Numerical Recipes in Fortran: the art of scientific computing (2nd Ed.). Cambridge University Press, Cambridge.
Rubinov, A. (2000), Abstract Convexity and Global Optimization. Kluwer Academic Publishers, Dordrecht.
Shubert, B. (1972), A sequential method seeking the global maximum of a function, SIAM Journal of Numerical Analysis, 9, 379–388.
Xu, Z., Huang, H., Pardalos, P. and Xu, C. (2001), Filled functions for unconstrained global optimization, Journal of Global Optimization, 20, 49–65.
Yao, Y. (1989), Dynamic tunneling algorithm for global optimization, IEEE Transactions on Systems, Man, and Cybernetics 19, 1222–1230.
Zhang, L., Ng, C., Li, D. and Tian, W. (2001), A new filled function method for global optimization, Journal of Global Optimization, to appear.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yiu, K., Liu, Y. & Teo, K. A Hybrid Descent Method for Global Optimization. Journal of Global Optimization 28, 229–238 (2004). https://doi.org/10.1023/B:JOGO.0000015313.93974.b0
Issue Date:
DOI: https://doi.org/10.1023/B:JOGO.0000015313.93974.b0