An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms
From MaRDI portal
Publication:1367876
DOI10.1007/BF02568512zbMath0887.90098MaRDI QIDQ1367876
Publication date: 6 May 1998
Published in: Top (Search for Journal in Brave)
62H30: Classification and discrimination; cluster analysis (statistical aspects)
90C25: Convex programming
90B85: Continuous location
65C99: Probabilistic methods, stochastic differential equations
Related Items
Estimating actual distances by norm functions: A comparison between the \(l_{k,p,\theta}\)-norm and the \(l_{b_1,b_2,\theta}\)-norm and a study about the selection of the data set, Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
Cites Work
- A simple heuristic for the p-centre problem
- On the uniqueness of optimal solutions in continuous location theory
- A duality theorem for non-linear programming
- On minimax optimization problems
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Finding Groups in Data
- Properties of ordinary and weighted sums of order $p$ used for distance estimation
- Analytic Inequalities
- The Minimum Covering Sphere Problem