Two Algorithms for the Minimum Enclosing Ball Problem
From MaRDI portal
Publication:3395020
DOI10.1137/070690419zbMath1180.90240MaRDI QIDQ3395020
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
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C46: Optimality conditions and duality in mathematical programming
Related Items
Unnamed Item, On the elimination of inessential points in the smallest enclosing ball problem, Chebyshev centres, Jung constants, and their applications, A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach, A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee, Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries, A new algorithm for the minimax location problem with the closest distance, The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems, On the hardness of the consensus string problem, A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training, Two-string consensus problem under non-overlapping inversion and transposition distance, On a minimum enclosing ball of a collection of linear subspaces, A dual simplex-type algorithm for the smallest enclosing ball of balls, Uncertainty quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball, A branch-and-bound method for the minimum \(k\)-enclosing ball problem, Frank-Wolfe and friends: a journey into projection-free first-order optimization methods, 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, Fast algorithms for the minimum volume estimator, 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
Uses Software
