@article{oai:tsukuba.repo.nii.ac.jp:00047926, author = {久野, 誉人 and Kuno, Takahito}, issue = {2}, journal = {Journal of global optimization}, month = {Jun}, note = {The simplicial algorithm is a popular branch-and-bound approach to the convex maximization problem with multiple local maxima. In this paper, we discuss some difficulties revealed when implementing this algorithm under the ω-subdivision rule. To overcome those, we modify the bounding process and extend the ω-subdivision rule. We also report numerical results for the simplicial algorithm according to the new subdivision rule.}, pages = {297--311}, title = {A modified simplicial algorithm for convex maximization based on an extension of ω -subdivision}, volume = {71}, year = {2018} }