Inexact Proximal Point Methods for Quasiconvex Minimization on Hadamard Manifolds

In this paper we present two inexact proximal point algorithms to solve minimization problems for quasiconvex objective functions on Hadamard manifolds. We prove that under natural assumptions the sequence generated by the algorithms are well defined and converge to critical points of the problem. We also present an application of the method to demand theory in economy

Citation

Report optim 2015-1, PESC-UFRJ, Bloco H-Fundão, march 2015

Article

Download

View Inexact Proximal Point Methods for Quasiconvex Minimization on Hadamard Manifolds