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.
Nancy Baygorrea· Erik Alex Papa Quiroz ·Nelson Maculan . Inexact Proximal Point Methods for Quasiconvex Minimization on Hadamard Manifolds[J]. Journal of the Operations Research Society of China, 2016 , 4(4) : 397 . DOI: 10.1007/s40305-016-0133-3
/
| 〈 |
|
〉 |
