An application of proof mining to the proximal point algorithm in CAT(0) spaces
From MaRDI portal
Publication:5223002
DOI10.1142/9789813237315_0008zbMATH Open1416.03028arXiv1707.09169OpenAlexW4234764465MaRDI QIDQ5223002FDOQ5223002
Authors: Laurenţiu Leuştean, Andrei Sipoş 
Publication date: 4 July 2019
Published in: Mathematics Almost Everywhere (Search for Journal in Brave)
Abstract: We compute, using techniques originally introduced by Kohlenbach, the first author and Nicolae, uniform rates of metastability for the proximal point algorithm in the context of CAT(0) spaces (as first considered by Bacak), specifically for the case where the ambient space is totally bounded. This result is part of the program of proof mining, which aims to apply methods of mathematical logic with the purpose of extracting quantitative information out of ordinary mathematical proofs, which may not be necessarily constructive.
Full work available at URL: https://arxiv.org/abs/1707.09169
Recommendations
- Effective strong convergence of the proximal point algorithm in CAT(0) spaces
- Abstract strongly convergent variants of the proximal point algorithm
- An abstract proximal point algorithm
- Effective metastability of Halpern iterates in \(CAT(0)\) spaces
- Proximal minimization in \(\mathrm{CAT}(\kappa)\) spaces
Cited In (8)
- Effective metastability for a method of alternating resolvents
- Old and new challenges in Hadamard spaces
- Quantitative results on a Halpern-type proximal point algorithm
- On Korpelevich's extragradient algorithm
- Metastability of the proximal point algorithm with multi-parameters
- An abstract proximal point algorithm
- PROOF MINING IN Lp SPACES
- Effective strong convergence of the proximal point algorithm in CAT(0) spaces
This page was built for publication: An application of proof mining to the proximal point algorithm in CAT(0) spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5223002)
