On an extension of the $omega$-subdivision rule used in the simplicial algorithm for convex maximization (The state-of-the-art optimization technique and future development)

Abstract

In this paper, we discuss some difficulties of the simplicial algorithm detected in implementing under the $omega$-subdivision rule. To overcome those, we modify the bounding process and extend $omega$-subdivision. We also report numerical results for the simplicial algorithm according to this new subdivision rule.