5 citations · 10 across the 4 of their papers we have counts for
4 papers
A dual Simplex-type algorithm for the smallest enclosing ball of balls and related problems
Marta Cavaleiro, Farid Alizadeh
We define the notion of infimum of a set of points with respect to the second order cone. This problem can be showed to be equivalent to the minimum ball containing a set of balls…
A branch-and-bound algorithm for the minimum radius -enclosing ball problem
Marta Cavaleiro, Farid Alizadeh
The minimum -enclosing ball problem seeks the ball with smallest radius that contains at least~ of~ given points in a general -dimensional Euclidean space. This problem…
A faster dual algorithm for the Euclidean minimum covering ball problem
Marta Cavaleiro, Farid Alizadeh
Dearing and Zeck presented a dual algorithm for the problem of the minimum covering ball in . Each iteration of their algorithm has a computational complexity of at l…
Second-Order Cone Programming for P-Spline Simulation Metamodeling
Yu Xia, Farid Alizadeh
This paper approximates simulation models by B-splines with a penalty on high-order finite differences of the coefficients of adjacent B-splines. The penalty prevents overfitting.…