Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
