The Log-Exponential Smoothing Technique and Nesterov's Accelerated Gradient Method for Generalized Sylvester Problems

: 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. Key words. log-exponential smoothing; minimization majorization algorithm; Nesterov’s accelerated gradient method; generalized Sylvester problem.

• Type: Journal
• Year: 2016
• Where: JOTA
• Authors: An Thai Nguyen, Daniel Giles, Nguyen Mau Nam, R. Blake Rector
• Keywords: JOTA 2016