Abstract
In this article, we propose two modified proximal point algorithms for computing the solutions of the inclusion problems in the setting of Hadamard manifolds. In the first algorithm, we use line search method, whereas in the second algorithm, we use simple self adaptive stepsize rule. We study the convergence analysis for both the algorithms under mild assumptions. We present a numerical example to demonstrate the efficiency of the proposed algorithms.
| Original language | English |
|---|---|
| Pages (from-to) | 6595-6606 |
| Number of pages | 12 |
| Journal | Soft Computing |
| Volume | 28 |
| Issue number | 9-10 |
| DOIs | |
| State | Published - May 2024 |
| Externally published | Yes |
Bibliographical note
Publisher Copyright:© The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.
Keywords
- Hadamard manifolds
- Maximal monotone vector fields
- Variational inclusion problems
- Variational inequality problems
ASJC Scopus subject areas
- Theoretical Computer Science
- Software
- Geometry and Topology