期刊文献+

二次检索

题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

年份

学科

共找到1篇文章
< 1 >
每页显示 20 50 100
A randomized nonmonotone adaptive trust region method based on the simulated annealing strategy for unconstrained optimization
1
作者 Saman Babaie-Kafaki Saeed Rezaee 《International Journal of Intelligent Computing and Cybernetics》 EI 2019年第3期389-399,共11页
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 simulate... 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. 展开更多
关键词 Nonlinear programming Simulated annealing Adaptive radius trust region method Unconstrained optimization
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部