Abstract
An algorithm for finding the Chebyshev center of a finite point set in the Euclidean spaceR n is proposed. The algorithm terminates after a finite number of iterations. In each iteration of the algorithm the current point is projected orthogonally onto the convex hull of a subset of the given point set.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Goldbach R (1992) Inkugel und Umkugel konvexer Polyeder. Diplomarbeit, Institut für Angewandte Mathematik und Statistik, Julius-Maximilians-Universität, Würzburg
Pschenichny BN (1980) Convex Analysis and Extremal Problems. Nauka, Moscow
Secitani K, Yamamoto Y (1991) A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes. Science Report No 462, Institute of Socio-Economic Planning, University of Tsukuba
Welzl E (1991) Smallest Enclosing Disks (Balls and Ellipsoids). Lecture Notes in Computer Science vol 555. Springer-Verlag, Berlin, pp 359–370
Author information
Authors and Affiliations
Additional information
Communicated by J. Stoer
Part of this research was done at the University of Würzburg (Institut für Angewandte Mathematik und Statistik) when the first author was supported by the Alexander von Humboldt Foundation, Germany.
On leave from the Institute of Mathematics and Mechanics, Ural Department of Russia Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str.16, Russia.
Rights and permissions
About this article
Cite this article
Botkin, N.D., Turova-Botkina, V.L. An algorithm for finding the Chebyshev center of a convex polyhedron. Appl Math Optim 29, 211–222 (1994). https://doi.org/10.1007/BF01204183
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01204183