A generalization of ω-subdivision ensuring convergence of the simplicial algorithm
A generalization of ω-subdivision ensuring convergence of the simplicial algorithm
复制标题
确保单纯算法收敛的 ω 细分的推广
DOI：
10.1007/s10589-015-9817-6
复制
发表时间：
2016
影响因子：
2.2
通讯作者：
and T. Ishihama
中科院分区：
文献类型：
--
作者：
T. Kuno;and T. Ishihama
本文改进了Kuno-Buckland（J Global Optim 52：371-390，2012）对带-细分的单纯形算法的收敛性证明，并推广了他们的-对分规则，建立了一类细分规则，称为-k-截面，它将单次细分中生成的子单纯形的数量限制在一个指定的数量k之内。我们还报告了一些数值结果比较的k-截面规则与通常的细分规则。
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 numberk. We also report some numerical results of comparing the-k-section rule with the usual-subdivision rule.