MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Recently a lot of work has been done on geometric means of positive definite matrices (see here and here for example). Has anyone extended this concept to larger sets of matrices (copositive, for instance)?

share|cite|improve this question

The Karcher (or Cartan) mean is defined as a distance minimizer and works on other manifolds; for instance, people studied means of orthogonal matrices (for instance,,, which have applications in optics and medical imaging. Maher Moakher, Pierre-Antoine Absil and Jonathan H. Manton worked on generic gradient descent methods that work in any Riemannian manifold. The standard examples are the usual arithmetic mean, the geometric mean on the positive cone, and the mean on the orthogonal (Stiefel) manifold, but maybe they have something more exotic in their "examples" sections.

The Ando-Li-Mathias paper ( defines by continuity means of semidefinite matrices as well, but that's not a very meaningful extension.

Bini and Iannazzo are working on means of Toeplitz and similarly structured matrices (,%20B.%20Iannazzo,%20B.%20Jeuris%20and%20R.%20Vandebril%20-%20Geometric%20means%20of%20structured%20matrices%20-%20Preprint.pdf). But that's more of a restriction than an extension.

That's all I know on extensions of the concept to other sets of matrices; as far as I know there is nothing specific on copositive.

share|cite|improve this answer

The cone of copositive matrices is convex, but it is not a symmetric cone. So the common notion of "geometric means" on this cone will look different from geometric means on symmetric spaces. See for example, Section 2 of this recent paper for some discussion of geometric means on symmetric spaces.

Even if you were able to define a Cartan mean on the set of copositive matrices, it'll probably be uncomputable, and therefore not so useful (primarily because testing membership in this cone is hard).

A related, interesting direction worth considering might be to instead consider the cone of double nonnegative matrices; this is (as you are I guess well aware) a subset of the CP matrices, while still being computationally tractable.

share|cite|improve this answer

Another viewpoint, some inequalities of definite positive matrix, for example arithmetic-geometric means inequality, harmonic-geometric mean inquality,... are some special cases of more general things. That is called connection. Let $M_n^+ = \{ A \in M_n | A\ \text{is a semi-definite matrix} \}$

An connection is a binary operation $\sigma: M^+_n \times M^+_n \rightarrow M^+_n$ sastisfies:

1, $A \le B, C \le D \Rightarrow A \sigma C \le B \sigma D$.

2, $C(A \sigma B) C \le (CAC) \sigma (CBC)$.

3, $\sigma$ is continuous.

Mean is a connection with $1 \sigma 1 = 1$.

Example: $A \nabla B = \dfrac{A+B}{2}$, geometric mean is a connection.

We can get many ralations between the connection and some matric inequalities, for eaxample trace inequalities:

You can search on internet with keywords connections matrix inequalities.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.