Two Algorithms for the Minimum Enclosing Ball Problem

DOI10.1137/070690419zbMath1180.90240OpenAlexW2027752345MaRDI QIDQ3395020

E. Alper Yıldırım

Publication date: 20 August 2009

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/22911

zbMATH Keywords

approximation algorithmscore setsminimum enclosing balls

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items (21)

Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries ⋮ The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems ⋮ A branch-and-bound method for the minimum \(k\)-enclosing ball problem ⋮ Polynomial time approximation schemes for all 1-center problems on metric rational set similarities ⋮ A reformulation-linearization based algorithm for the smallest enclosing circle problem ⋮ Two-string consensus problem under non-overlapping inversion and transposition distance ⋮ On the hardness of the consensus string problem ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ On the elimination of inessential points in the smallest enclosing ball problem ⋮ Frank-Wolfe and friends: a journey into projection-free first-order optimization methods ⋮ A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training ⋮ On a minimum enclosing ball of a collection of linear subspaces ⋮ A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach ⋮ A dual simplex-type algorithm for the smallest enclosing ball of balls ⋮ A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee ⋮ Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem ⋮ Solving \(k\)-center problems involving sets based on optimization techniques ⋮ Chebyshev centres, Jung constants, and their applications ⋮ Uncertainty quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball ⋮ Unnamed Item ⋮ Fast algorithms for the minimum volume estimator

Uses Software

• Miniball

This page was built for publication: Two Algorithms for the Minimum Enclosing Ball Problem