LAUSR

In this paper, we deal with the minimization problem for computing Karcher mean on a symmetric cone. The objective of this minimization problem consists of the sum of squares of the Riemannian distances with many given points in a symmetric cone. Moreover, the problem can be reduced to a bound-constrained minimization problem. These motivate us to adapt an incremental gradient method. So we propose an incremental gradient method and establish its global convergence properties exploiting the Lipschitz continuity of the gradient of the Riemannian distance function.