Title
On the convergence rate of an inexact proximal point algorithm for quasiconvex minimization on hadamard manifolds
Date Issued
01 December 2017
Access level
metadata only access
Resource Type
journal article
Author(s)
Federal University of Rio de Janeiro
Publisher(s)
Springer Berlin Heidelberg
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.
Start page
457
End page
467
Volume
5
Issue
4
Language
English
OCDE Knowledge area
Matemáticas aplicadas
Subjects
Scopus EID
2-s2.0-85037606159
Source
Journal of the Operations Research Society of China
ISSN of the container
2194-668X
Sponsor(s)
This work was supported by Coordenação de Aperfeiçoamento de Pessoal de Nível Superior of the Federal University of Rio de Janeiro (UFRJ), Brazil.
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior CAPES
Conselho Nacional de Desenvolvimento Científico e Tecnológico 302578/2014-5 CNPq
Sources of information:
Directorio de Producción Científica
Scopus