Mathematical Programming

, Volume 111, Issue 1–2, pp 57–93

# On the symmetry function of a convex set

• Alexandre Belloni
• Robert M. Freund
FULL LENGTH PAPER

## Abstract

We attempt a broad exploration of properties and connections between the symmetry function of a convex set S $${S \subset\mathbb{R}^n}$$ and other arenas of convexity including convex functions, convex geometry, probability theory on convex sets, and computational complexity. Given a point $${x \in S}$$, let sym(x,S) denote the symmetry value of x in S:

$${{\bf sym}(x,S):= max\{\alpha \ge 0 : x+\alpha(x-y) \in S {\rm for every} y \in S\}}$$, which essentially measures how symmetric S is about the point x, and define $${\bf sym}({\it S}):= \max_{x\in S} \, {\bf sym}({\it x,S})$$ x * is called a symmetry point of S if x * achieves the above maximum. The set S is a symmetric set if sym (S)=1. There are many important properties of symmetric convex sets; herein we explore how these properties extend as a function of sym (S) and/or sym (x,S). By accounting for the role of the symmetry function, we reduce the dependence of many mathematical results on the strong assumption that S is symmetric, and we are able to capture and otherwise quantify many of the ways that the symmetry function influences properties of convex sets and functions. The results in this paper include functional properties of sym (x,S), relations with several convex geometry quantities such as volume, distance, and cross-ratio distance, as well as set approximation results, including a refinement of the Löwner-John rounding theorems, and applications of symmetry to probability theory on convex sets. We provide a characterization of symmetry points x * for general convex sets. Finally, in the polyhedral case, we show how to efficiently compute sym(S) and a symmetry point x * using linear programming. The paper also contains discussions of open questions as well as unproved conjectures regarding the symmetry function and its connection to other areas of convexity theory.

## Mathematics Subject Classification (2000)

90C25 65K05 90C27

## References

1. 1.
Anderson T.W. (1955) The integral of a symmetric unimodal function. Proc.Amer. Math. Soc. 6, 170–176
2. 2.
Ball, K.: An elementary introduction to modern convex geometry. Flavors of Geometry, MSRI Publications, Vol. 31 (1997)Google Scholar
3. 3.
Barnes, E.: Private communication (1998)Google Scholar
4. 4.
Belloni, A., Freund, R.M.: Projective pre-conditioners for improving the behavior of a homogeneous conic linear system. MIT ORC Working Paper OR-375–05 May 2005Google Scholar
5. 5.
Bertsimas D., Vempala S. (2004) Solving convex programs by random walks. J. ACM 51(4), 540–556
6. 6.
Bonnans, J.F., Gilbert, J.C., Lemaréchal, C., Sagastizábal, C.: Numerical Optimization: Theoretical and Practical Aspects. p. xiv+423. Universitext, Springer, Berlin Heidelbreg New York (2003)Google Scholar
7. 7.
Dudley, R.: Uniform Central Limit Thoerems. Cambridge University Press (2000)Google Scholar
8. 8.
Eaves B.C., Freund R.M. (1982) Optimal scaling of balls and polyhedra. Math. Program. 23, 138–147
9. 9.
Epelman M., Freund R.M. (2002) A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems. SIAM J. Optim. 12(3), 627–655
10. 10.
Gardner R.J.(2002) The Brunn-Minkowski inequality. Bull. Am. Math. Soc. 39(3), 355–405
11. 11.
Grünbaum B. (1960) Partitions of mass-distributions and convex bodies by hyperplanes. Pacific J. Math. 10, 1257–1261
12. 12.
Grünbaum, B.: Measures of symmetry for convex sets. In: Convexity, Proceedings of Symposia in Pure Mathematics vol. 7, pp. 233–270 American Mathematical Society, Providence (1963)Google Scholar
13. 13.
Grötschel M., Lovász L., Schrijver A. (1994) Geometric Algorithms and Combinatorial Optimization. Springer, Berlin Heidelberg New YorkGoogle Scholar
14. 14.
Hammer P.C. (1951) The centroid of a convex body. Proc. Amer. Math. Soc. 5, 522–525
15. 15.
John, F.: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays, pp. 187–204. Presented to R. Courant on His 60th Birthday, Interscience, New York (1948)Google Scholar
16. 16.
Klee V. (1953) The critical set of convex body. Am. J. Math. 75, 178–188
17. 17.
Lovász, L., Vempala, S.: Logconcave functions: Geometry and efficient sampling algorithms. In: Proc. of the 44th IEEE Foundations of Computer Science, Boston (2003)Google Scholar
18. 18.
Minkowski, H.: Allegemeine Lehzätze über konvexe Polyeder. Ges. Abh. 2, 103–121 (1911)Google Scholar
19. 19.
Renegar, J.: Linear programming, complexity theory and elementary functional analysis. Math. Program. 70(3), (1995)Google Scholar
20. 20.
Roos C., Terlaky T., Vial J.-P. (1997) Theory and Algorithms for Linear Optimization: An Interior Point Approach. Wiley, New York
21. 21.
Tseng P. (1992) Complexity analysis of a linear complementarity algorithm based on a Lyapunov function. Math. Program. 53, 297–306