Given a convex set CC in a real vector space EE and two points x,y∈Cx,y\in C, we investigate which are the possible values for the variation f(y)−f(x)f(y)-f(x), where f:C⟶[m,M]f:C\longrightarrow [m,M] is a bounded convex function. We then rewrite the bounds in terms of the Funk weak metric, which will imply that a bounded convex function is Lipschitz-continuous with respect to the Thompson and Hilbert metrics. The bounds are also proved to be optimal. We also exhibit the maximal subdifferential of a bounded convex function at a given point x∈Cx\in C.

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

Joon Kwon

Institut de Mathématiques, Équipe Combinatoire et Optimisation, Université Pierre-et-Marie-Curie, 4 place Jussieu, 75252 Paris Cedex 05, France

joon.kwon@ens-lyon.org
  1. P. Funk: Über Geometrien, bei denen die Geraden die Kürzesten sind, Math. Ann. 101 (1929) 226–237.https://doi.org/10.1007/BF01454835Google Scholar
  2. D. Hilbert: Über die gerade Linie als kürzeste Verbindung zweier Punkte, Math. Ann. 46 (1895) 91–96.https://doi.org/10.1007/BF02096204Google Scholar
  3. A. Papadopoulos, M. Troyanov: Weak metrics on Euclidean domains, JP J. Geom. Topol. 7(1) (2007) 23–43.Google Scholar
  4. A. C. Thompson: On certain contraction mappings in a partially ordered vector space, Proc. Amer. Math. Soc. 14 (1963) 438–443.https://doi.org/10.1090/S0002-9939-1963-0149237-7Google Scholar

J. Kwon. “A Universal Bound on the Variations of Bounded Convex Functions.” Journal of Convex Analysis 24 (2017), No. 1, 67–73. https://doi.org/10.68381/jca24005