Abstract
In this paper, we introduce a hybrid-type proximal point algorithm for approximating zero of monotone operator in Hadamard-type spaces. We then prove that a sequence generated by the algorithm involving Mann-type iteration converges strongly to a zero of the said operator in the setting of flat Hadamard spaces. To the best of our knowledge, this result presents the first hybrid-type proximal point algorithm in the space. The result is applied to convex minimization and fixed point problems.
| Original language | English |
|---|---|
| Pages (from-to) | 845-857 |
| Number of pages | 13 |
| Journal | Kragujevac Journal of Mathematics |
| Volume | 48 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 2024 |
| Externally published | Yes |
Keywords
- Fixed Points
- flat Hadamard spaces
- hybrid-type algorithm
- monotone operators
- proximal point algorithm
Fingerprint
Dive into the research topics of 'ON THE PROXIMAL POINT ALGORITHM OF HYBRID-TYPE IN FLAT HADAMARD SPACES WITH APPLICATIONS'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver