The Log-Exponential Smoothing Technique and Nesterov's Accelerated Gradient Method for Generalized Sylvester Problems
Optimization and Control
2015-03-18 v5
Abstract
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.
Cite
@article{arxiv.1303.7247,
title = {The Log-Exponential Smoothing Technique and Nesterov's Accelerated Gradient Method for Generalized Sylvester Problems},
author = {Nguyen Thai An and Daniel Giles and Nguyen Mau Nam and R. Blake Rector},
journal= {arXiv preprint arXiv:1303.7247},
year = {2015}
}