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