Minimization of sub-topical functions over a simplex

نویسندگان
Yaghoobi, M.A. ID 1
Daryaei, M.H. ID 2

1 Department of Applied Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran.

2 Department of Applied Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman, Kerman, Iran.

doi
10.22067/ijnao.2023.83361.1290
چکیده

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 numericalexperiments.

کلیدواژه‌ها
Abstract convexity, Global optimization, Sub-topical functions, Cutting angle method