18 citations · 20 across the 4 of their papers we have counts for
4 papers · 1 filter
Smoothing Algorithms for Computing the Projection onto a Minkowski Sum of Convex Sets
Xiaolong Qin, Nguyen Thai An
In this paper, the problem of computing the projection, and therefore the minimum distance, from a point onto a Minkowski sum of general convex sets is studied. Our approach is bas…
Convergence Analysis of a Proximal Point Algorithm for Minimizing Differences of Functions
Nguyen Thai An, Nguyen Mau Nam
Several optimization schemes have been known for convex optimization problems. However, numerical algorithms for solving nonconvex optimization problems are still underdeveloped. A…
Solutions Constructions of a Generalized Sylvester Problem and a Generalized Fermat-Torricelli Problem for Euclidean Balls
Nguyen Mau Nam, Nguyen Hoang, Nguyen Thai An
The classical Apollonius' problem is to construct circles that are tangent to three given circles in a plane. This problem was posed by Apollonius of Perga in his work "Tangencies"…
Applications of Convex Analysis to the Smallest Intersecting Ball Problem
Nguyen Mau Nam, Nguyen Thai An, Juan Salinas
The smallest enclosing circle problem asks for the circle of smallest radius enclosing a given set of finite points on the plane. This problem was introduced in the 19th century by…