A sharp cut algorithm for optimization (vol 35, pg 2716, 2011)

doi:10.1016/j.compchemeng.2021.107390

A sharp cut algorithm for optimization (vol 35, pg 2716, 2011)

2021-09-01

0

PRE

AI

DOI：10.1016/j.compchemeng.2021.107390

原文链接

原文求助

摘要

En 中文

In Inamdar et al. (2011), the authors had mentioned about doing gradient calculations and weights multiplying the selected farthest point to compute a cutting plane. There was an error in the procedure that the gradients were calculated after multiplication by weight, whereas gradients are to be calculated using the farthest point set prior to multiplying by weights. Now, after making the necessary changes the answers obtained by Kelley's algorithm and sharp cut algorithm are the same except the latter converges about 20% to 45% faster than the former. The correction is reported here. (C) 2021 Elsevier Ltd. All rights reserved.

Keyword:

Sharp cut algorithm

Cutting plane

Gradient set

Farthest point set

Rate of convergence

A sharp cut algorithm for optimization (vol 35, pg 2716, 2011)

摘要

AI总结

期刊

机构