scholarly journals The Asymptotic Behavior of the Composition of Firmly Nonexpansive Mappings

2015 ◽  
Vol 167 (2) ◽  
pp. 409-429 ◽  
Author(s):  
David Ariza-Ruiz ◽  
Genaro López-Acedo ◽  
Adriana Nicolae
2009 ◽  
Vol 71 (12) ◽  
pp. e1626-e1632 ◽  
Author(s):  
Koji Aoyama ◽  
Fumiaki Kohsaka ◽  
Wataru Takahashi

Author(s):  
Nicholas Pischke ◽  
Ulrich Kohlenbach

AbstractWe use techniques originating from the subdiscipline of mathematical logic called ‘proof mining’ to provide rates of metastability and—under a metric regularity assumption—rates of convergence for a subgradient-type algorithm solving the equilibrium problem in convex optimization over fixed-point sets of firmly nonexpansive mappings. The algorithm is due to H. Iiduka and I. Yamada who in 2009 gave a noneffective proof of its convergence. This case study illustrates the applicability of the logic-based abstract quantitative analysis of general forms of Fejér monotonicity as given by the second author in previous papers.


Sign in / Sign up

Export Citation Format

Share Document