Results 1  10
of
70
General logical metatheorems for functional analysis
, 2008
"... In this paper we prove general logical metatheorems which state that for large classes of theorems and proofs in (nonlinear) functional analysis it is possible to extract from the proofs effective bounds which depend only on very sparse local bounds on certain parameters. This means that the bounds ..."
Abstract

Cited by 45 (26 self)
 Add to MetaCart
(Show Context)
In this paper we prove general logical metatheorems which state that for large classes of theorems and proofs in (nonlinear) functional analysis it is possible to extract from the proofs effective bounds which depend only on very sparse local bounds on certain parameters. This means that the bounds are uniform for all parameters meeting these weak local boundedness conditions. The results vastly generalize related theorems due to the second author where the global boundedness of the underlying metric space (resp. a convex subset of a normed space) was assumed. Our results treat general classes of spaces such as metric, hyperbolic, CAT(0), normed, uniformly convex and inner product spaces and classes of functions such as nonexpansive, HölderLipschitz, uniformly continuous, bounded and weakly quasinonexpansive ones. We give several applications in the area of metric fixed point theory. In particular, we show that the uniformities observed in a number of recently found effective bounds (by proof theoretic analysis) can be seen as instances of our general logical results.
A quantitative version of a theorem due to BorweinReichShafrir
 Numerical Functional Analysis and Optimization
, 2000
"... We give a quantitative analysis of a result due to Borwein, Reich and Shafrir on the asymptotic behaviour of the general KrasnoselskiMann iteration for nonexpansive selfmappings of convex sets in arbitrary normed spaces. Besides providing explicit bounds we also get new qualitative results concerni ..."
Abstract

Cited by 25 (14 self)
 Add to MetaCart
(Show Context)
We give a quantitative analysis of a result due to Borwein, Reich and Shafrir on the asymptotic behaviour of the general KrasnoselskiMann iteration for nonexpansive selfmappings of convex sets in arbitrary normed spaces. Besides providing explicit bounds we also get new qualitative results concerning the independence of the rate of convergence of the norm of that iteration from various input data. In the special case of bounded convex sets, where by wellknown results of Ishikawa, Edelstein/O'Brian and Goebel/Kirk the norm of the iteration converges to zero, we obtain uniform bounds which do not depend on the starting point of the iteration and the nonexpansive function, but only depend on the error #, an upper bound on the diameter of C and some very general information on the sequence of scalars # k used in the iteration. Only in the special situation, where # k := # is constant, uniform bounds were known in that bounded case. For the unbounded case, no quantitative information was ...
A quadratic rate of asymptotic regularity for CAT(0)spaces
, 2005
"... In this paper we obtain a quadratic bound on the rate of asymptotic regularity for the KrasnoselskiMann iterations of nonexpansive mappings in CAT(0)spaces, whereas previous results guarantee only exponential bounds. The method we use is to extend to the more general setting of uniformly convex hy ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
In this paper we obtain a quadratic bound on the rate of asymptotic regularity for the KrasnoselskiMann iterations of nonexpansive mappings in CAT(0)spaces, whereas previous results guarantee only exponential bounds. The method we use is to extend to the more general setting of uniformly convex hyperbolic spaces a quantitative version of a strengthening of Groetsch’s theorem obtained by Kohlenbach using methods from mathematical logic (socalled “proof mining”).
Proof Interpretations and the Computational Content of Proofs. Draft of book in preparation
, 2007
"... This survey reports on some recent developments in the project of applying proof theory to proofs in core mathematics. The historical roots, however, go back to Hilbert’s central theme in the foundations of mathematics which can be paraphrased by the following question ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
(Show Context)
This survey reports on some recent developments in the project of applying proof theory to proofs in core mathematics. The historical roots, however, go back to Hilbert’s central theme in the foundations of mathematics which can be paraphrased by the following question
Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
 Fixed Point Theory and Applications
, 2005
"... In 1979, Ishikawa proved a strong convergence theorem for finite families of nonexpansive mappings in general Banach spaces. Motivated by Ishikawa’s result, we prove strong convergence theorems for infinite families of nonexpansive mappings. 1. ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
(Show Context)
In 1979, Ishikawa proved a strong convergence theorem for finite families of nonexpansive mappings in general Banach spaces. Motivated by Ishikawa’s result, we prove strong convergence theorems for infinite families of nonexpansive mappings. 1.
On the computational content of the Krasnoselski and Ishikawa fixed point theorems
, 2000
"... This paper is a case study in proof mining applied to noneffective proofs in nonlinear functional analysis. More specifically, we are concerned with the fixed point theory of nonexpansive selfmappings f of convex sets C in normed spaces. We study the Krasnoselski iteration as well as more general ..."
Abstract

Cited by 13 (10 self)
 Add to MetaCart
This paper is a case study in proof mining applied to noneffective proofs in nonlinear functional analysis. More specifically, we are concerned with the fixed point theory of nonexpansive selfmappings f of convex sets C in normed spaces. We study the Krasnoselski iteration as well as more general socalled KrasnoselskiMann iterations. These iterations converge to fixed points of f under certain compactness conditions. But, as we show, already for uniformly convex spaces in general no bound on the rate of convergence can be computed uniformly in f . This is related to the nonuniqueness of fixed points. However, the iterations yield even without any compactness assumption and for arbitrary normed spaces approximate fixed points of arbitrary quality for bounded C (asymptotic regularity, Ishikawa 1976). We apply proof theoretic techniques (developed in previous papers of us) to noneffective proofs of this regularity and extract effective uniform bounds on the rate of the asymptotic re...
Iterative methods for approximation of fixed points and their applications
 J. Oper. Res. Soc. Japan
"... Abstract In this article, we deal with iterative methods for approximation of fixed points and their applications. We first discuss fixed point theorems for a nonexpansive mapping or a family of nonexpansive mappings. In particular, we state a fixed point theorem which answered affirmatively a probl ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
Abstract In this article, we deal with iterative methods for approximation of fixed points and their applications. We first discuss fixed point theorems for a nonexpansive mapping or a family of nonexpansive mappings. In particular, we state a fixed point theorem which answered affirmatively a problem posed during the Conference on Fixed Point Theory and Applications held at CIRM, MarseilleLuminy, 1989. Then we discuss nonlinear ergodic theorems of Baillon's type for nonlinear semigroups of nonexpansive mappings. In particular, we state nonlinear ergodic theorems which answered affirmatively the problem posed during the Second World Congress on Nonlinear Analysts, Athens, Greece, 1996. Next, we deal with weak and strong convergence theorems of Mann's type and Halpern's type in a Banach space. Finally, using these results, we consider the feasibility problem by convex combinations of nonexpansive retractions and the convex minimization problem of finding a minimizer of a convex function. 1.