3 citations · 5 across the 4 of their papers we have counts for
4 papers · 1 filter
A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets
Nguyen Thai An, Nguyen Mau Nam, Nguyen Dong Yen
We study a location problem that involves a weighted sum of distances to closed convex sets. As several of the weights might be negative, traditional solution methods of convex opt…
The Log-Exponential Smoothing Technique and Nesterov's Accelerated Gradient Method for Generalized Sylvester Problems
Nguyen Thai An, Daniel Giles, Nguyen Mau Nam +1
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 S…
Subgradient Algorithm, Stochastic Subgradient Algorithm, Incremental Subgradient Algorithm, and Set Location Problems
Nguyen Mau Nam, Nguyen Thai An, Han Le
In recent years, important progress has been made in applying methods and techniques of convex optimization to many fields of applications such as location science, engineering, co…
Minimal time functions and the smallest intersecting ball problem generated by unbounded dynamics
Nguyen Mau Nam, Cristina Villalobos, Nguyen Thai An
The smallest enclosing circle problem introduced in the 19th century by J. J. Sylvester [20] aks for the circle of smallest radius enclosing a given set of finite points in the pla…