Minimization of sub-topical functions over a simplex | ||
| Iranian Journal of Numerical Analysis and Optimization | ||
| مقاله 8، دوره 14، Issue 1 - شماره پیاپی 28، بهار 2024، صفحه 200-218 اصل مقاله (540.87 K) | ||
| نوع مقاله: Research Article | ||
| شناسه دیجیتال (DOI): 10.22067/ijnao.2023.83361.1290 | ||
| نویسندگان | ||
| M.H. Daryaei* ؛ M.A. Yaghoobi | ||
| Department of Applied Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran. | ||
| چکیده | ||
| This article investigates a particular version of the cutting angle method for finding the global minimizer of sub-topical (increasing and plus sub-homogeneous) functions over a simplex. The algorithm is based on the abstract convexity of sub-topical functions. Furthermore, we discuss the proof of convergence of the algorithm and provide results from numerical experiments. | ||
| کلیدواژهها | ||
| Abstract convexity؛ Global optimization؛ Sub-topical functions؛ Cutting angle method | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 38,648 تعداد دریافت فایل اصل مقاله: 39,821 |
||