Abstract strongly convergent variants of the proximal point algorithm

Andrei Sipoş ()
Additional contact information
Andrei Sipoş: University of Bucharest

Computational Optimization and Applications, 2022, vol. 83, issue 1, No 11, 349-380

Abstract: Abstract We prove an abstract form of the strong convergence of the Halpern-type and Tikhonov-type proximal point algorithms in CAT(0) spaces. In addition, we derive uniform and computable rates of metastability (in the sense of Tao) for these iterations using proof mining techniques.

Keywords: Halpern iteration; Proximal point algorithm; CAT(0); Jointly firmly nonexpansive families; Proof mining; Rates of metastability; 90C25; 46N10; 47J25; 47H09; 03F10 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-022-00397-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:83:y:2022:i:1:d:10.1007_s10589-022-00397-5

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-022-00397-5

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().