@article{oai:tsukuba.repo.nii.ac.jp:00038509,
 author = {久野, 誉人 and Kuno, Takahito and Ishihama, Tomohiro},
 issue = {2},
 journal = {Computational optimization and applications},
 month = {Jun},
 note = {In this paper, we refine the proof of convergence by Kuno–Buckland (J Global Optim 52:371–390, 2012) for the simplicial algorithm with ω-subdivision and generalize their ω-bisection rule to establish a class of subdivision rules, called ω-k-section, which bounds the number of subsimplices generated in a single execution of subdivision by a prescribed number k. We also report some numerical results of comparing the ω-k-section rule with the usual ω-subdivision rule.},
 pages = {535--555},
 title = {A generalization of ω -subdivision ensuring convergence of the simplicial algorithm},
 volume = {64},
 year = {2016}
}