Consider a convex polytope over n-dimensions defined by m linear inequalities.
Is the Chebyshev Center (Chebyshev Center) unique?
Currently, I am getting different coordinates for the center in MATLAB and python - especially in high dimensions (>10).
Since the polytope is a convex set and that the norm is a convex function, the global optimum should be unique. (https://en.wikipedia.org/wiki/Chebyshev_center#Mathematical_representation).
How are you computing it ?