# دانلود رایگان مقاله رویکرد هیبریدی برای بهینه سازی جهانی تحت فشار

عنوان فارسی
رویکرد هیبریدی برای بهینه سازی جهانی تحت فشار
عنوان انگلیسی
A hybrid approach to constrained global optimization
صفحات مقاله فارسی
0
صفحات مقاله انگلیسی
14
سال انتشار
2016
نشریه
الزویر - Elsevier
فرمت مقاله انگلیسی
PDF
کد محصول
E304
رشته های مرتبط با این مقاله
ریاضی و مهندسی صنایع
گرایش های مرتبط با این مقاله
ریاضی کاربردی و بهینه سازی سیستم ها
مجله
محاسبات نرم کاربردی - Applied Soft Computing
دانشگاه
گروه ریاضی، دانشگاه کرتین، پرت، استرالیا
کلمات کلیدی
بهینه سازی جهانی، مجازات دقیق، حریص انتشار جستجو، روش BFGS
چکیده

Abstract

In this paper, we propose a novel hybrid global optimization method to solve constrained optimization problems. An exact penalty function is first applied to approximate the original constrained optimization problem by a sequence of optimization problems with bound constraints. To solve each of these box constrained optimization problems, two hybrid methods are introduced, where two different strategies are used to combine limited memory BFGS (L-BFGS) with Greedy Diffusion Search (GDS). The convergence issue of the two hybrid methods is addressed. To evaluate the effectiveness of the proposed algorithm, 18 box constrained and 4 general constrained problems from the literature are tested. Numerical results obtained show that our proposed hybrid algorithm is more effective in obtaining more accurate solutions than those compared to.

نتیجه گیری

5. Conclusion

Deterministic optimization methods, such as BFGS method, are known for their fast convergence for solving convex optimization problems. However, they tend to be trapped in local minima for non-convex problems. In this paper, we proposed two hybrid algorithms for constrained global optimization. Based on the exact penalty function method, the constrained optimization problems were transformed into box-constrained optimization problems. Then, a novel reposition technique, Greedy Diffusion Search (GDS), is proposed to integrate with limited memory BFGS (L-BFGS) under two different strategies, where GDS is to enable the algorithm to escape from local minima. We have shown that our algorithms are convergent to a global minimizer with probability one. 18 box constrained optimization problems and 4 general constrained optimization problems are solved by the proposed methods. The results obtained were compared with those obtained by existing methods. Comparisons show that our methods can achieve higher accuracy with less number of function evaluations. However, as LBFGS is used in our two hybrid methods, the functions involved in Problem (P) are required to be smooth. It is clearly an important task to develop effective hybrid algorithms to solve non-smooth optimization problems.

بدون دیدگاه