The Log-Exponential Smoothing Technique and Nesterov’s Accelerated Gradient Method for Generalized Sylvester Problems
https://link.springer.com/article/10.1007%2Fs10957-015-0811-zPublisher, magazine: ,
Publication year: 2016
Lưu Trích dẫn Chia sẻAbstract
The Sylvester or smallest enclosing circle problem involves finding the smallest circle enclosing 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.
Tags: Log-exponential smoothing technique, Majorization minimization algorithm, Nesterov’s accelerated gradient method ,Generalized Sylvester problem
Các bài viết liên quan đến tác giả Nguyễn Thái An
A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets
Solving k-center problems involving sets based on optimization techniques
Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
Convergence analysis of a proximal point algorithm for minimizing differences of functions
Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems
Minimal Time Functions and the Smallest Intersecting Ball Problem with Unbounded Dynamics
Applications of Convex Analysis to the Smallest Intersecting Ball Problem