Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
From MaRDI portal
Publication:3395021
DOI10.1137/080727208zbMath1180.90232OpenAlexW1978006402MaRDI QIDQ3395021
E. Alper Yıldırım, Selin Damla Ahipaşaoğlu
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/22942
Numerical mathematical programming methods (65K05) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)
Related Items (5)
A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids ⋮ On the elimination of inessential points in the smallest enclosing ball problem ⋮ A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach ⋮ Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem ⋮ Fast algorithms for the minimum volume estimator
This page was built for publication: Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem