Resumen
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.
| Idioma original | Inglés |
|---|---|
| Páginas (desde-hasta) | 397-424 |
| Número de páginas | 28 |
| Publicación | Journal of the Operations Research Society of China |
| Volumen | 4 |
| N.º | 4 |
| DOI | |
| Estado | Publicada - 1 dic. 2016 |
| Publicado de forma externa | Sí |
Huella
Profundice en los temas de investigación de 'Inexact Proximal Point Methods for Quasiconvex Minimization on Hadamard Manifolds'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver