An algorithm for finding the Chebyshev center of a convex polyhedron-Reference-Cited by-同舟云学术

An algorithm for finding the Chebyshev center of a convex polyhedron

Published:1994-03 Issue:2 Volume:29 Page:211-222
ISSN:0095-4616
Container-title:Applied Mathematics & Optimization
language:en
Short-container-title:Appl Math Optim

Author:

Botkin N. D.,Turova-Botkina V. L.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1007/BF01204183.pdf

Reference4 articles.

1. Goldbach R (1992) Inkugel und Umkugel konvexer Polyeder. Diplomarbeit, Institut für Angewandte Mathematik und Statistik, Julius-Maximilians-Universität, Würzburg

2. Pschenichny BN (1980) Convex Analysis and Extremal Problems. Nauka, Moscow

3. 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

4. Welzl E (1991) Smallest Enclosing Disks (Balls and Ellipsoids). Lecture Notes in Computer Science vol 555. Springer-Verlag, Berlin, pp 359?370

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Inexact Bundle Method for Semi-Infinite Minimax Problems;Asia-Pacific Journal of Operational Research;2024-08-07

2. An Algorithm for Finding the Generalized Chebyshev Center of Sets Defined via Their Support Functions;Автоматика и телемеханика;2024-06-15

3. An Algorithm for Finding the Generalized Chebyshev Center of Sets Defined via Their Support Functions;Automation and Remote Control;2024-06

4. Compact Boundary Matrix from a Polytopal Complex for Computing Persistent Homology;2023 IEEE International Conference on Big Data (BigData);2023-12-15

5. Modified gradient sampling algorithm for nonsmooth semi-infinite programming;Journal of Applied Mathematics and Computing;2023-11-22