Abstract

We present an approximate algorithm for calculation of the Chebyshev center for a convex compact subset from Rn which is given via its supporting function. We reduce the problem to the solution of a linear programming problem and estimate the error between an approximate and the exact solutions in terms of the step of a grid.

Author information

Contact details are reproduced from the original publication and may be historical.

Maxim V. Balashov

V. A. Trapeznikov Institute of Control Sciences, Moscow, Russia 117997

balashov73@mail.ru

Keywords

  • Chebyshev center
  • stability of minimization problem
  • Hausdorff distance
  • linear programming
  • supporting function

Mathematics Subject Classification

49J52, 49J53, 52A20; 52B12, 90C05

Suggested citation

M. V. Balashov. “Approximate Calculation of the Chebyshev Center for a Convex Compact Set in R^(n).” Journal of Convex Analysis 29 (2022), No. 1, 157–164.

Copyright Heldermann Verlag 2022