Abstract:

The proximal point algorithm has many interesting applications, such as signal recovery, signal processing and others. In recent years, the proximal point method has been extended to Riemannian manifolds. The main advantages of these extensions are that nonconvex problems in classic sense may become geodesic convex by introducing an appropriate Riemannian metric, constrained optimization problems may be seen as unconstrained ones. In this paper, we propose an inexact proximal point algorithm for geodesic convex vector function on Hadamard manifolds. Under the assumption that the objective function is coercive, the sequence generated by this algorithm converges to a Pareto critical point.When the objective function is coercive and strictly geodesic convex, the sequence generated by this algorithm converges to a Pareto optimal point. Furthermore, under the weaker growth condition, we prove that the inexact proximal point algorithm has linear/superlinear convergence rate.

Key words: Inexact proximal point algorithm ·, Hadamard manifolds ·Convergence rate ·, Pareto critical point ·, Pareto optimal point