The Log-Exponential Smoothing Technique and Nesterov's Accelerated Gradient Method for Generalized Sylvester Problems
An, Nguyen Thai · Giles, Daniel · Nam, Nguyen Mau · Rector, R. Blake
Original · EN
The Sylvester smallest enclosing circle problem involves finding the smallest circle that encloses a finite number of points in the plane. We consider generalized versions of the Sylvester problem in which the points are replaced by sets. Based on the log-exponential smoothing technique and Nesterov's accelerated gradient method, we present an effective numerical algorithm for solving these problems.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.