On the convergence rate of a proximal point algorithm for vector function on Hadamard manifolds (Q1697905): Difference between revisions

The authors propose a so-called inexact proximal point algorithm by extending previous methods for multiobjective optimization problems with geodesic convex functions. They also study the convergence of the points generated by the algorithm and establish conditions guaranteeing convergence to Pareto critical and Pareto optimal points.