Centers of sets with symmetry or cyclicity properties
We introduce an axiomatic formalism for the concept of the center of a set in a Euclidean space. Then we explain how to exploit possible symmetries and possible cyclicities in the set in order to localize its center. Special attention is paid to the determination of centers in cones of matrices. Despite its highly abstract flavor, our work has a strong connection with convex optimization theory. In fact, computing the so-called “incenter” of a solid closed convex cone is a matter of solving a nonsmooth convex optimization program. On the other hand, the concept of the incenter of a solid closed convex cone has a bearing on the complexity analysis and design of algorithms for convex optimization programs under conic constraints.
KeywordsCenter of a set Symmetry space Cyclicity space Convex cone Cones of matrices Incenter and circumcenter Nonsmooth convex optimization
Mathematics Subject Classification15A48 47L07
- Gowda MS (2012) On copositive and completely positive cones and Z-transformations. Electron J Linear Algebra 23:198–211 Google Scholar
- Henrion R, Seeger A (2011) Condition number and eccentricity of a closed convex cone. Math Scand 109:285–308 Google Scholar
- Iusem A, Seeger A (2005) Axiomatization of the index of pointedness for closed convex cones. Comput Appl Math 24:245–283 Google Scholar
- Seeger A (2011) Epigraphical cones I. J Convex Anal 18:1171–1196 Google Scholar