On Properties of Solutions for a Class of Functional Equations Arising in Dynamic Programming

The existence, uniqueness, and iterative approximation of solutions for a class of functional equations arising in dynamic programming of multistage decision processes are discussed. Our results resolve in the affirmative an open problem posed in Ref. 1 and generalize important known results.     

Fixed Points and Asymptotic Behavior for Asymptotically Nonexpansive Type Semigroups in Banach Spaces

Let X be a Banach space with a weakly continuous duality map Jψ, C a non-empty weakly compact convex subset of X, and T = (T(t) : t ∈ S} an asymptotically nonexpansive type semigroup on C. In this paper, the inequality K ∩ F(T) ≠ (?) is characterized, where K is a subset of C and F(T) is the set of all common fixed points of T. Furthermore, it is shown that an almost-orbit     

渐近伪压缩映象的收敛性定理

在任意的实Banach空间中,证明了一致Lipschitzian和渐近伪压缩映象的具误差的Ishikawa和Mann迭代序列的一些收敛性定理.     

UNIFORM NORMAL STRUCTURE AND SOLUTIONS OF REICH’S OPEN QUESTION

IntroductionThroughout this paper we assume thatEis a real Banach space,E*is the dual space ofE,Dis a nonempty subset ofEandJ:E→2E*is the normalized duality mapping defined byJ(x)={f∈E*:〈x,f〉=‖x‖.‖f‖,‖f‖=‖x‖},x∈E,(1)where〈.,.〉denotes the ge     

The method of alternating projections and the method of subspace corrections in Hilbert space

A new identity is given in this paper for estimating the norm of the product of nonexpansive operators in Hilbert space. This identity can be applied for the design and analysis of the method of alternating projections and the method of subspace corrections. The method of alternating projections is an iterative algorithm for determining the best approximation to any given point in a Hilbert space from the intersection of a finite number of subspaces by alternatively computing the best approximations from the individual subspaces which make up the intersection. The method of subspace corrections is an iterative algorithm for finding the solution of a linear equation in a Hilbert space by approximately solving equations restricted on a number of closed subspaces which make up the entire space. The new identity given in the paper provides a sharpest possible estimate for the rate of convergence of these algorithms. It is also proved in the paper that the method of alternating projections is essentially equivalent to the method of subspace corrections. Some simple examples of multigrid and domain decomposition methods are given to illustrate the application of the new identity.

     

Finding best approximation pairs relative to two closed convex sets in Hilbert spaces

We consider the problem of finding a best approximation pair, i.e., two points which achieve the minimum distance between two closed convex sets in a Hilbert space. When the sets intersect, the method under consideration, termed AAR for averaged alternating reflections, is a special instance of an algorithm due to Lions and Mercier for finding a zero of the sum of two maximal monotone operators. We investigate systematically the asymptotic behavior of AAR in the general case when the sets do not necessarily intersect and show that the method produces best approximation pairs provided they exist. Finitely many sets are handled in a product space, in which case the AAR method is shown to coincide with a special case of Spingarn's method of partial inverses.     

The equivalence between the convergences of Ishikawa and Mann iterations for an asymptotically nonexpansive in the intermediate sense and strongly successively pseudocontractive maps

The convergence of modified Mann iteration is equivalent to the convergence of modified Ishikawa iterations, when T is an asymptotically nonexpansive in the intermediate sense and strongly successively pseudocontractive map.     

Banach空间中渐近非扩张映象的带误差的修正的Ishikawa与Mann迭代程序

设E是满足Opial条件的一致凸Banach空间,C是E的一非空闭凸子集,T:C→C是渐近非扩张映象.又设对任给的x1∈C,序列{xn}由下列带误差的修正的Ishikawa迭代程序生成:其中, 是C中的序列,使得 且数列 满足下列条件(i)和(ii)之一: (i)tn∈[a,b]且sn∈[O,b];(ii)tn∈[a,b]且sn∈[a,b],这里,常数a,b满足0相似文献   

Regularization methods for accretive variational inequalities over the set of common fixed points of nonexpansive semigroups

In this paper, we introduce a regularization method based on the Browder–Tikhonov regularization method for solving a class of accretive variational inequalities over the set of common fixed points of a nonexpansive semigroup on a uniformly smooth Banach space. Three algorithms based on this regularization method are given and their strong convergence is studied. Finally, a finite-dimensional example is developed to illustrate the numerical behaviour of the algorithms.     

Strong convergence of the composite Halpern iteration

Let C be a closed convex subset of a uniformly smooth Banach space E and let T:C→C be a nonexpansive mapping with a nonempty fixed points set. Given a point u∈C, the initial guess x₀∈C is chosen arbitrarily and given sequences , and in (0,1), the following conditions are satisfied:

(i)

;

(ii)

αn→0, βn→0 and 0<a?γn, for some a∈(0,1);

(iii)

, and . Let be a composite iteration process defined by