Rank-two update algorithm versus Frank–Wolfe algorithm with away steps for the weighted Euclidean one-center problem

Abstract

The weighted Euclidean one-center (WEOC) problem is one of the classic problems in facility location theory, which is also a generalization of the minimum enclosing ball (MEB) problem. Given m points in $${\mathbb {R}}^{n}$$, the WEOC problem computes a center point $$c\in {\mathbb {R}}^{n}$$ that minimizes the maximum weighted Euclidean distance to m given points. The rank-two update algorithm is an effective method for solving the minimum volume enclosing ellipsoid (MVEE) problem. It updates only two components of the solution at each iteration, which was previously proposed in Cong et al. (Comput Optim Appl 51(1):241–257, 2012). In this paper, we further develop and analyze the rank-two update algorithm for solving the WEOC problem. At each iteration, the calculation of the optimal step-size for the WEOC problem needs to distinguish four different cases, which is a challenge in comparison with the MVEE problem. We establish the theoretical results of the complexity and the core set size of the rank-two update algorithm for the WEOC problem, which are the generalizations of the currently best-known results for the MEB problem. In addition, by constructing an important inequality for the WEOC problem, we establish the linear convergence of this rank-two update algorithm. Numerical experiments show that the rank-two update algorithm is comparable to the Frank–Wolfe algorithm with away steps for the WEOC problem. In particular, the rank-two update algorithm is more efficient than the Frank–Wolfe algorithm with away steps for problem instances with $$m\gg n$$ under high precision.