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.
| Original language | English |
|---|---|
| Pages (from-to) | 457-467 |
| Number of pages | 11 |
| Journal | Journal of the Operations Research Society of China |
| Volume | 5 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1 Dec 2017 |
| Externally published | Yes |
Keywords
- Abstract subdifferential
- Convergence rate
- Hadamard manifolds
- Nonsmooth optimization
- Proximal point method
- Quasiconvex function
Fingerprint
Dive into the research topics of 'On the Convergence Rate of an Inexact Proximal Point Algorithm for Quasiconvex Minimization on Hadamard Manifolds'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver