.png){kind=icon}
.png){kind=icon}
Return
A sharp cut algorithm for optimization (vol 35, pg 2716, 2011)
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2021.107390.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Sharp cut algorithm
Cutting plane
Gradient set
Farthest point set
Rate of convergence
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.9
Papers:
8.1K
Citations:
1.7W