A Rate of Metastability for the Halpern Type Proximal Point Algorithm

Using proof-theoretical techniques, we analyze a proof by Hong-Kun Xu regarding a result of strong convergence for the Halpern type proximal point algorithm. We obtain a rate of metastability (in the sense of Terence Tao) and also a rate of asymptotic regularity for the iteration. Furthermore, our f...

Full description

Bibliographic Details

Published in:	Numerical functional analysis and optimization Vol. 42; no. 3; pp. 320 - 343
Main Author:	Pinto, Pedro
Format:	Journal Article
Language:	English
Published:	Abingdon Taylor & Francis 17.02.2021 Taylor & Francis Ltd
Subjects:	Algorithms Metastability Metastable state proof mining proximal point algorithm rates of asymptotic regularity sequential weak compactness
ISSN:	0163-0563, 1532-2467
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!