Photo by helloimnik from unsplash
In this paper, we present an analysis about the rate of convergence of an inexact proximal point algorithm to solve minimization problems for quasiconvex objective functions on Hadamard manifolds. We… Click to show full abstract
In this paper, we present an analysis about the rate of convergence 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.
Keywords:
point algorithm;
hadamard manifolds;
proximal point;
point;
rate;
inexact proximal
Journal Title: Journal of the Operations Research Society of China
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of the Operations Research Society of China
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!