On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds

In this paper we present a rate of convergence analysis of an inexact proximal point algorithm to solve minimization problems for quasiconvex objective functions on Hadamard manifolds. We prove that under natural assumptions the sequence generated by the algorithm converges linearly or superlinearly to a critical point of the problem.

Article

Download

View On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on Hadamard manifolds