A randomized nonmonotone adaptive trust region method based on the simulated annealing strategy for unconstrained optimization. Issue 3 (8th July 2019)

• Record Type: Journal Article
• Authors: Babaie-Kafaki, Saman; Rezaee, Saeed
• Is Part Of: International journal of intelligent computing and cybernetics. Volume 12:Issue 3(2019)
• Page Start: 389
• Page End: 399
• Publication Date: 2019-07-08
• Subjects: Nonlinear programming -- Simulated annealing -- Adaptive radius -- Trust region method -- Unconstrained optimization; Artificial intelligence -- Periodicals; Cybernetics -- Periodicals; 006.3
• DOI: 10.1108/IJICC-12-2018-0178
• Languages: English
• ISSNs: 1756-378X

Abstract

Abstract : Purpose: The purpose of this paper is to employ stochastic techniques to increase efficiency of the classical algorithms for solving nonlinear optimization problems. Design/methodology/approach: The well-known simulated annealing strategy is employed to search successive neighborhoods of the classical trust region (TR) algorithm. Findings: An adaptive formula for computing the TR radius is suggested based on an eigenvalue analysis conducted on the memoryless Broyden-Fletcher-Goldfarb-Shanno updating formula. Also, a (heuristic) randomized adaptive TR algorithm is developed for solving unconstrained optimization problems. Results of computational experiments on a set of CUTEr test problems show that the proposed randomization scheme can enhance efficiency of the TR methods. Practical implications: The algorithm can be effectively used for solving the optimization problems which appear in engineering, economics, management, industry and other areas. Originality/value: The proposed randomization scheme improves computational costs of the classical TR algorithm. Especially, the suggested algorithm avoids resolving the TR subproblems for many times.