Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
|
|
- Augustus Young
- 5 years ago
- Views:
Transcription
1 Sakurai and Iiduka Fixed Point Theory and Applications 2014, 2014:202 R E S E A R C H Open Access Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping Kaito Sakurai * and Hideaki Iiduka * Correspondence: k_sakurai@cs.meiji.ac.jp Department of Computer Science, Meiji University, Higashimita, Tama-ku, Kawasaki-shi, Kanagawa , Japan Abstract This paper presents an algorithm to accelerate the Halpern fixed point algorithm in a real Hilbert space. To this goal, we first apply the Halpern algorithm to the smooth convex minimization problem, which is an example of a fixed point problem for a nonexpansive mapping, and indicate that the Halpern algorithm is based on the steepest descent method for solving the minimization problem. Next, we formulate a novel fixed point algorithm using the ideas of conjugate gradient methods that can accelerate the steepest descent method. We show that, under certain assumptions, our algorithm strongly converges to a fixed point of a nonexpansive mapping. We numerically compare our algorithm with the Halpern algorithm and show that it dramatically reduces the running time and iterations needed to find a fixed point compared with that algorithm. MSC: 47H10; 65K05; 90C25 Keywords: conjugate gradient method; fixed point; Halpern algorithm; nonexpansive mapping; smooth convex optimization; steepest descent method 1 Introduction Fixed point problems for nonexpansive mappings [1, Chapter 4], [2,Chapter3],[3,Chapter 1], [4, Chapter 3] have been investigated in many practical applications, and they include convex feasibility problems [5], [1, Example 5.21], convex optimization problems [1, Corollary 17.5], problems of finding the zeros of monotone operators [1, Proposition 23.38], and monotonevariational inequalities [1, Subchapter 25.5]. Fixed point problems can be solved by using useful fixed point algorithms, suchasthe Krasnosel skiĭ-mann algorithm [1,Subchapter5.2],[6,Subchapter1.2],[7, 8],the Halpern algorithm [6, Subchapter1.2],[9, 10], and the hybrid method [11]. Meanwhile, to make practical systems and networks see, e.g., [12 15] and references therein) stable and reliable, the fixed point has to be found at a faster pace. That is, we need a new algorithm that approximates the fixed point faster than the conventional ones. In this paper, we focus on the Halpern algorithm and present an algorithm to accelerate the search for a fixed point of a nonexpansive mapping. To achieve the main objective of this paper, we first apply the Halpern algorithm to the smooth convex minimization problem, which is an example of a fixed point problem for 2014 Sakurai and Iiduka; licensee Springer. This is an Open Access article distributed under the terms of the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
2 Sakurai and IidukaFixed Point Theory and Applications 2014, 2014:202 Page 2 of 11 a nonexpansive mapping, and indicate that the Halpern algorithm is based on the steepest descent method [16, Subchapter 3.3] for solving the minimization problem. Anumberofiterativemethods[16, Chapters 5-19] have been proposed to accelerate the steepest descent method. In particular, conjugate gradient methods [16, Chapter 5] have been widely used as an efficient accelerated version of most gradient methods. Here, we focus on the conjugate gradient methods and devise an algorithm blending the conjugate gradient methods with the Halpern algorithm. Our main contribution is to propose a novel algorithm for finding a fixed point of a nonexpansive mapping, for which we use the ideas of accelerated conjugate gradient methods for optimization over the fixed point set [17, 18], and prove that the algorithm converges to some fixed point in the sense of the strong topology of a real Hilbert space. To demonstrate the effectiveness and fast convergence of our algorithm, we numerically compare our algorithm with the Halpern algorithm. Numerical results show that it dramatically reduces the running time and iterations needed to find a fixed point compared with that algorithm. This paper is organized asfollows.section2 gives the mathematical preliminaries. Section 3 devises the acceleration algorithm for solving fixed point problems and presents its convergence analysis. Section 4 applies the proposed and conventional algorithms to a concrete fixed point problem and provides numerical examples comparing them. 2 Mathematical preliminaries Let H be a real Hilbert space with the inner product, and its induced norm,and let N be the set of all positive integers including zero. 2.1 Fixed point problem Suppose that C H is nonempty, closed, and convex. A mapping T : C C is said to be nonexpansive [1, Definition 4.1ii)], [2, 3.2)], [3,Subchapter1.1],[4,Subchapter3.1]if Tx) Ty) x y x, y C). The fixed point set of T : C C is denoted by FixT):= { x C : Tx)=x }. The metric projection onto C [1, Subchapter4.2,Chapter28]isdenotedbyP C.Itis defined by P C x) C and x P C x) = inf y C x y x H). P C is nonexpansive with FixP C )=C [1, Proposition 4.8, 4.8)]. Proposition 2.1 Suppose that C H is nonempty, closed, and convex, T : C Cisnonexpansive, and x H. Then i) [1, Corollary 4.15], [2, Lemma 3.4], [3, Proposition 5.3], [4, Theorem 3.1.6] FixT) is closed and convex. ii) [1, Theorem 3.14] ˆx = P C x) if and only if x ˆx, y ˆx 0 y C). Proposition 2.1i) guarantees that if FixT), P FixT) x) exists for all x H. This paper discusses the following fixed point problem.
3 Sakurai and IidukaFixed Point Theory and Applications 2014, 2014:202 Page 3 of 11 Problem 2.1 Suppose that T : H H is nonexpansive with FixT).Then find x H such that T x ) = x. 2.2 The Halpern algorithm and our algorithm The Halpern algorithm generates the sequence x n ) n N [6, Subchapter1.2][9, 10] asfollows: given x 0 H and α n ) n N satisfying lim α n =0, n=0 α n =, and n=0 α n+1 α n <, x n+1 := α n x 0 +1 α n )Tx n ) n N). 1) Algorithm 1) strongly converges to P FixT) x 0 ) FixT)) [6, Theorem 6.17], [9, 10]. Here, we shall discuss Problem 2.1 when FixT) is the set of all minimizers of a convex, continuously Fréchet differentiable functional f over H and see that algorithm 1)is based on the steepest descent method [16, Subchapter 3.3] to minimize f over H. Supposethat the gradient of f,denotedby f, is Lipschitz continuous with a constant L >0anddefine T f : H H by T f := I α f, 2) where α 0, 2/L]andI : H H stands for the identity mapping. Accordingly, T f satisfies the nonexpansivity condition see, e.g.,[12, Proposition 2.3]) and Fix T f ) { = argmin f x):= x H : f x ) } = min f x). x H x H Therefore, algorithm 1)withT := T f can be expressed as follows. d f n+1 := f x n), y n := T f x n )=x n α f x n )=x n + αd f n+1, x n+1 := α n x 0 +1 α n )y n n N). 3) This implies that algorithm 3) uses the steepest descent direction [16, Subchapter3.3] d f,sdd n+1 := f x n )off at x n, and hence algorithm 3) is based on the steepest descent method. Meanwhile, conjugate gradient methods [16, Chapter 5] are popular acceleration methods of the steepest descent method. The conjugate gradient direction of f at x n n N) is d f,cgd n+1 := f x n )+β n dn f,cgd,whered f,cgd 0 := f x 0 )andβ n ) n N 0, ), which, together with 2), implies that d f,cgd n+1 = 1 T f ) x n ) x n + βn dn f,cgd. 4) α Therefore, by replacing d f n+1 := f x n)inalgorithm3)withd f,cgd n+1 defined by 4), we can formulate a novel algorithm for solving Problem 2.1. Beforepresentingthealgorithm,weprovidethefollowinglemmaswhichareusedto prove the main theorem.
4 Sakurai and IidukaFixed Point Theory and Applications 2014, 2014:202 Page 4 of 11 Proposition 2.2 [6, Lemmas 1.2 and 1.3] Let a n ) n N,b n ) n N,c n ) n N,α n ) n N 0, ) be sequences with a n+1 1 α n )a n + α n b n + c n n N). Suppose that n=0 α n =, lim sup b n 0, and n=0 c n <. Then lim a n =0. Proposition 2.3 [19, Lemma 1] Suppose that x n ) n N Hweaklyconvergestox Hand y x. Then lim inf x n x < lim inf x n y. 3 Acceleration of the Halpern algorithm We present the following algorithm. Algorithm 3.1 Step 0. Choose μ 0, 1], α >0,andx 0 H arbitrarily, and set α n ) n N 0, 1), β n ) n N [0, ). Compute d 0 := Tx 0 ) x 0 )/α. Step 1. Given x n, d n H,computed n+1 H by d n+1 := 1 α Txn ) x n ) + βn d n. Compute x n+1 H as follows. y n := x n + αd n+1, x n+1 := μα n x 0 +1 μα n )y n. Put n := n +1,andgotoStep1. We can check that Algorithm 3.1 coincides with the Halpern algorithm 1)whenβ n := 0 n N)andμ := 1. This section makes the following assumptions. Assumption 3.1 The sequences α n ) n N and β n ) n N satisfy a C1) lim α n =0, C2) α n =, n=0 C3) α n+1 α n <, n=0 C4) β n α 2 n n N). Moreover, x n ) n N in Algorithm 3.1 satisfies C5) Txn ) x n ) n N is bounded. Let us do a convergence analysis of Algorithm 3.1. Theorem 3.1 Under Assumption 3.1, the sequence x n ) n N generated by Algorithm 3.1 strongly converges to P FixT) x 0 ). Algorithm 3.1 when β n := 0 n N) is the Halpern algorithm defined by x n+1 := μα n x 0 +1 μα n )Tx n ) n N).
5 Sakurai and IidukaFixed Point Theory and Applications 2014, 2014:202 Page 5 of 11 Hence, the nonexpansivity of T ensures that, for all x FixT)andforalln N, x n+1 x = μα n x 0 x)+1 μα n ) Tx n ) x ) μα n x 0 x +1 μα n ) Tx n ) x μα n x 0 x +1 μα n ) x n x. 5) Suppose that n := 0. From 5), we have x 1 x μα 0 x 0 x +1 μα 0 ) x 0 x = x 0 x. Assume that x m x x 0 x for some m N. Then5) impliesthat x m+1 x μα m x 0 x +1 μα m ) x m x μα m x 0 x +1 μα m ) x 0 x = x 0 x. Hence, induction guarantees that x n x x 0 x n N). Therefore, we find that x n ) n N is bounded. Moreover, since the nonexpansivity of T ensures that Tx n )) n N is also bounded, C5) holds. Accordingly, Theorem 3.1 says that if α n ) n N satisfies C1)-C3), Algorithm 3.1 when β n := 0 n N) i.e., the Halpern algorithm) strongly converges to P FixT) x 0 ). This means that Theorem 3.1 is a generalization of the convergence analysis of the Halpern algorithm. 3.1 Proof of Theorem 3.1 We first show the following lemma. Lemma 3.1 Suppose that Assumption 3.1 holds. Then d n ) n N,x n ) n N, and y n ) n N are bounded. Proof We have from C1) and C4) that lim β n = 0. Accordingly, there exists n 0 N such that β n 1/2 for all n n 0.DefineM 1 := max{ d n0,2/α) sup n N Tx n ) x n }.Then C5) implies that M 1 <. Assume that d n M 1 for some n n 0. The triangle inequality ensures that d n+1 = 1 ) Txn ) x n + βn d n 1 Tx n ) x n + β n d n M 1, α α which means that d n M 1 for all n n 0, i.e.,d n ) n N is bounded. The definition of y n n N)impliesthat ) 1 ) y n = x n + α Txn ) x n + βn d n α = Tx n )+αβ n d n. 6) The nonexpansivity of T and 6) imply that, for all x FixT)andforalln n 0, y n x = Tx n )+αβ n d n x Tx n ) Tx) + αβ n d n x n x + αm 1 β n.
6 Sakurai and IidukaFixed Point Theory and Applications 2014, 2014:202 Page 6 of 11 Therefore, we find that, for all x FixT)andforalln n 0, x n+1 x = μα n x 0 x)+1 μα n )y n x) μα n x 0 x +1 μα n ) y n x μα n x 0 x +1 μα n ) { } x n x + αm 1 β n 1 μα n ) x n x + μα n x 0 x + αm 1 β n, which, together with C4) and α n <1n N), means that, for all x FixT) andforall n n 0, x n+1 x 1 μα n ) x n x + μα n x 0 x + αm ) 1. μ Induction guarantees that, for all x FixT)andforalln n 0, x n x x 0 x + αm 1 μ. Therefore, x n ) n N is bounded. The definition of y n n N) and the boundedness of x n ) n N and d n ) n N imply that y n ) n N is also bounded. This completes the proof. Lemma 3.2 Suppose that Assumption 3.1 holds. Then i) lim x n+1 x n =0. ii) lim x n Tx n ) =0. iii) lim sup x 0 x, y n x 0, where x := P FixT) x 0 ). Proof i) Equation 6), the triangle inequality, and the nonexpansivity of T imply that, for all n N, y n+1 y n = Txn+1 ) Tx n )+αβ n+1 d n+1 β n d n ) Txn+1 ) Tx n ) + α βn+1 d n+1 β n d n x n+1 x n + α β n+1 d n+1 + β n d n ), which, together with d n M 1 n n 0 )andc4),impliesthat,foralln n 0, y n+1 y n x n+1 x n + αm 1 α 2 n+1 + α 2 n). 7) On the other hand, from α n α n+1 α n + α n+1 and α n <1n N), we have that, for all n N, αn α2 n α2 n+1 + α ) n αn+1 α n + α n+1 α n+1 + α n )α n+1 + α n+1 α n. 8)
7 Sakurai and IidukaFixed Point Theory and Applications 2014, 2014:202 Page 7 of 11 We also find that, for all n N\{0}, x n+1 x n = μαn x 0 +1 μα n )y n ) μα n 1 x 0 +1 μα n 1 )y n 1 = μαn α n 1 )x 0 +1 μα n )y n y n 1 ) + μα n 1 α n )y n 1 μ α n α n 1 x 0 + y n 1 ) +1 μα n ) y n y n 1 1 μα n ) y n y n 1 + M 2 α n α n 1, where M 2 := sup n N μ x 0 + y n )<.Hence,7)and8)ensurethat,foralln n 0, x n+1 x n 1 μα n ) x n x n 1 + αm 1 αn + α n 1 )α n + α n α n 1 ) + M 2 α n α n 1 =1 μα n ) x n x n 1 +αm 1 + M 2 ) α n α n 1 + αm 1 μ α n + α n 1 )μα n. Proposition 2.2, C1), C2), and C3) lead us to lim x n+1 x n =0. 9) ii) From x n+1 y n = μα n x 0 y n M 2 α n n N), C1) means that lim x n+1 y n =0.Sincethetriangleinequalityensuresthat y n x n y n x n+1 + x n+1 x n n N), we find from 9)that lim d n+1 = 1 α lim y n x n =0. 10) From the definition of d n+1 n N), we have, for all n n 0, 0 1 Txn ) x n dn+1 + β n d n d n+1 + M 1 β n. α Since Equation 10) andlim β n = 0 guarantee that the right-hand side of the above inequality converges to 0, we find that lim Tx n ) x n =0. 11) iii) From the limit superior of x 0 x, y n x ) n N,thereexistsy nk ) k N y n ) n N ) such that lim sup x0 x, y n x = lim k x0 x, y nk x. 12) Moreover, since y nk ) k N is bounded, there exists y nki ) i N y nk ) k N )whichweaklyconverges to some point ŷ H). Equation 10) guaranteesthatx nki ) i N weakly converges to ŷ.
8 Sakurai and IidukaFixed Point Theory and Applications 2014, 2014:202 Page 8 of 11 We shall show that ŷ FixT). Assume that ŷ / FixT), i.e., ŷ Tŷ). Proposition 2.3, 11), and the nonexpansivity of T ensure that lim inf i x n ki ŷ < lim inf x nki Tŷ) i = lim inf xnki Tx nki )+Tx nki ) Tŷ) i = lim inf Txnki ) Tŷ) i lim inf x n i ki ŷ. This is a contradiction. Hence, ŷ FixT). Hence, 12) and Proposition 2.1ii) guarantee that lim sup x0 x, y n x = lim x0 x, y nki x = x 0 x, ŷ x 0. i This completes the proof. Now, we are in a position to prove Theorem 3.1. Proof of Theorem 3.1 The inequality x + y 2 x 2 +2 y, x + y x, y H), 6), and the nonexpansivity of T imply that, for all n N, y n x 2 = Tx n ) x + αβ n d n 2 Tx n ) T x ) 2 +2αβ n yn x, d n xn x 2 + M 3 α 2 n, where β n α 2 n n N) andm 3 := sup n N 2α y n x, d n <. Wethushavethat,forall n N, xn+1 x 2 = μαn x0 x ) +1 μα n ) y n x ) 2 = μ 2 αn 2 x0 x 2 +1 μα n ) 2 yn x 2 +2μα n 1 μα n ) x 0 x, y n x μ 2 αn 2 x 0 x 2 +1 μα n ) 2{ x n x 2 + M 3 αn 2 } +2μα n 1 μα n ) x 0 x, y n x 1 μα n ) xn x { 21 μα n ) x 0 x, y n x } μα n. { μα x0 n x 2 + M } 3α n μα n μ Proposition 2.2, C1), C2), and Lemma 3.2iii) lead one to deduce that lim xn+1 x 2 =0.
9 Sakurai and IidukaFixed Point Theory and Applications 2014, 2014:202 Page 9 of 11 This guarantees that x n ) n N generated by Algorithm 3.1 strongly converges to x := P FixT) x 0 ). Suppose that FixT) is bounded. Then we can set a bounded, closed convex set C FixT)) such that P C canbecomputedwithinafinitenumberofarithmeticoperations e.g., C is a closed ball with a large enough radius). Hence, we can compute x n+1 := P C μαn x 0 +1 μα n )y n ) 13) instead of x n+1 in Algorithm 3.1. Fromx n ) n N C, the boundedness of C means that x n ) n N is bounded. The nonexpansivity of T guarantees that Tx n ) Tx) x n x x FixT)), which means that Tx n )) n N is bounded. Therefore, C5) holds. We can prove that Algorithm 3.1 with 13) strongly converges to a point in FixT) by referring to the proof of Theorem 3.1. Let us consider the case where FixT) is unbounded. In this case, we cannot choose aboundedc satisfying FixT) C. Although we can execute Algorithm 3.1, we need to verify the boundedness of Tx n ) x n ) n N. Instead, we can apply the Halpern algorithm 1) to this case without any problem. However, the Halpern algorithm would converge slowly because it is based on the steepest descent method see Section 1). Hence, in this case, it would be desirable to execute not only the Halpern algorithm but also Algorithm Numerical examples and conclusion Let us apply the Halpern algorithm1) and Algorithm 3.1to the following convex feasibility problem [5], [1, Example 5.21]. Problem 4.1 Given a nonempty, closed convex set C i R N i =0,1,...,m), m find x C := C i, i=0 where one assumes that C. Define a mapping T : R N R N by 1 T := P 0 m m P i ), 14) i=1 where P i := P Ci i = 0,1,...,m) stands for the metric projection onto C i.sincep i i = 0,1,...,m) is nonexpansive, T defined by 14) is also nonexpansive. Moreover, we find that m m FixT)=FixP 0 ) FixP i )=C 0 C i = C. i=1 i=1 Therefore, Problem 4.1 coincides with Problem 2.1 with T defined by 14). The experiment used an Apple Macbook Air with a 1.30GHz IntelR) CoreTM) i5-4250u CPU and 4GB DDR3 memory. The Halpern algorithm 1) and Algorithm 3.1 were written in Java. The operating system of the computer was Mac OSX version
10 Sakurai and Iiduka Fixed Point Theory and Applications 2014, 2014:202 Page 10 of 11 Figure 1 Behavior of Tx n ) x n for the Halpern algorithm and Algorithm 3.1 proposed). The Halpern algorithm took 850 iterations to satisfy Tx n ) x n <10 6, whereas Algorithm 3.1 took only six.) We set α := 1, μ := 1/10 5, α n := 1/n +1)n N), and β n := 1/n +1) 2 n N) inalgorithm 3.1 and compared Algorithm 3.1 with the Halpern algorithm 1)withα n := μ/n +1) n N). In the experiment, we set C i i =0,1,...,m) asaclosedballwithcenterc i R N and radius r i >0.Thus,P i i =0,1,...,m)canbecomputedwith P i x):=c i + r i c i x x c i) if c i x > r i, or P i x):=x if c i x r i. We set N := 100, m := 3, r i := 1 i =0,1,2,3),and c 0 := 0. The experiment used random vectors c i 1/ N,1/ N) N i =1,2,3)generated by the java.util.randomclassso asto satisfy C. We also used the java.util.random class to set a random initial point in 16, 16) N. Figure 1 describes the behaviors of Tx n ) x n for the Halpern algorithm 1) and Algorithm 3.1 proposed). The x-axis and y-axis represent the elapsed time and value of Tx n ) x n. The results show that compared with the Halpern algorithm, Algorithm 3.1 dramatically reduces the time required to satisfy Tx n ) x n <10 6.Wefoundthat the Halpern algorithm took 850 iterations to satisfy Tx n ) x n <10 6,whereasAlgorithm 3.1 took only six. This paper presented an algorithm to accelerate the Halpern algorithm for finding a fixed point of a nonexpansive mapping on a real Hilbert space and its convergence analysis. The convergence analysis guarantees that the proposed algorithm strongly converges to a fixed point of a nonexpansive mapping under certain assumptions. We numerically compared the abilities of the proposed and Halpern algorithms in solving a concrete fixed point problem. The results showed that the proposed algorithm performs better than the Halpern algorithm. Competing interests The authors declare that they have no competing interests. Authors contributions All authors contributed equally to the writing of this paper. All authors read and approved the final manuscript. Acknowledgements We are sincerely grateful to the associate editor Lai-Jiu Lin and the two anonymous reviewers for helping us improve the original manuscript. Endnote a Examples of αn ) n N and β n ) n N satisfying C1)-C4) are α n := 1/n +1) a and β n := 1/n +1) 2a n N), where a 0, 1]. Received: 5 June 2014 Accepted: 3 September 2014 Published: 26 Sep 2014
11 Sakurai and Iiduka Fixed Point Theory and Applications 2014, 2014:202 Page 11 of 11 References 1. Bauschke, HH, Combettes, PL: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin 2011) 2. Goebel, K, Kirk, WA: Topics in Metric Fixed Point Theory. Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge 1990) 3. Goebel, K, Reich, S: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings. Dekker, New York 1984) 4. Takahashi, W: Nonlinear Functional Analysis. Yokohama Publishers, Yokohama 2000) 5. Bauschke, HH, Borwein, JM: On projection algorithms for solving convex feasibility problems. SIAM Rev. 383), ) 6. Berinde, V: Iterative Approximation of Fixed Points. Springer, Berlin 2007) 7. Krasnosel skiĭ, MA: Two remarks on the method of successive approximations. Usp. Mat. Nauk 10, ) 8. Mann, WR: Mean value methods in iteration. Proc. Am. Math. Soc. 4, ) 9. Halpern, B: Fixed points of nonexpansive maps. Bull. Am. Math. Soc. 73, ) 10. Wittmann, R: Approximation of fixed points of nonexpansive mappings. Arch. Math. 585), ) 11. Nakajo, K, Takahashi, W: Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups. J. Math. Anal. Appl. 279, ) 12. Iiduka, H: Iterative algorithm for solving triple-hierarchical constrained optimization problem. J. Optim. Theory Appl. 148, ) 13. Iiduka, H: Fixed point optimization algorithm and its application to power control in CDMA data networks. Math. Program. 133, ) 14. Iiduka, H: Iterative algorithm for triple-hierarchical constrained nonconvex optimization problem and its application to network bandwidth allocation. SIAM J. Optim. 223), ) 15. Iiduka, H: Fixed point optimization algorithms for distributed optimization in networked systems. SIAM J. Optim. 23, ) 16. Nocedal, J, Wright, SJ: Numerical Optimization, 2nd edn. Springer Series in Operations Research and Financial Engineering. Springer, Berlin 2006) 17. Iiduka, H: Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping. Math. Program. 2014). doi: /s Iiduka, H, Yamada, I: A use of conjugate gradient direction for the convex optimization problem over the fixed point set of a nonexpansive mapping. SIAM J. Optim. 194), ) 19. Opial, Z: Weak convergence of the sequence of successive approximation for nonexpansive mappings. Bull. Am. Math. Soc. 73, ) / Cite this article as: Sakurai and Iiduka: Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping. Fixed Point Theory and Applications 2014, 2014:202
PARALLEL SUBGRADIENT METHOD FOR NONSMOOTH CONVEX OPTIMIZATION WITH A SIMPLE CONSTRAINT
Linear and Nonlinear Analysis Volume 1, Number 1, 2015, 1 PARALLEL SUBGRADIENT METHOD FOR NONSMOOTH CONVEX OPTIMIZATION WITH A SIMPLE CONSTRAINT KAZUHIRO HISHINUMA AND HIDEAKI IIDUKA Abstract. In this
More informationAcceleration Method for Convex Optimization over the Fixed Point Set of a Nonexpansive Mapping
Noname manuscript No. will be inserted by the editor) Acceleration Method for Convex Optimization over the Fixed Point Set of a Nonexpansive Mapping Hideaki Iiduka Received: date / Accepted: date Abstract
More informationAPPROXIMATE SOLUTIONS TO VARIATIONAL INEQUALITY OVER THE FIXED POINT SET OF A STRONGLY NONEXPANSIVE MAPPING
APPROXIMATE SOLUTIONS TO VARIATIONAL INEQUALITY OVER THE FIXED POINT SET OF A STRONGLY NONEXPANSIVE MAPPING SHIGERU IEMOTO, KAZUHIRO HISHINUMA, AND HIDEAKI IIDUKA Abstract. Variational inequality problems
More informationsubject to W RM R + and H R R N
Fixed Point Algorithm for Solving Nonmonotone Variational Inequalities in Nonnegative Matrix Factorization This work was supported by the Japan Society for the Promotion of Science through a Grant-in-Aid
More informationNew Iterative Algorithm for Variational Inequality Problem and Fixed Point Problem in Hilbert Spaces
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 20, 995-1003 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.4392 New Iterative Algorithm for Variational Inequality Problem and Fixed
More informationResearch Article Strong Convergence of a Projected Gradient Method
Applied Mathematics Volume 2012, Article ID 410137, 10 pages doi:10.1155/2012/410137 Research Article Strong Convergence of a Projected Gradient Method Shunhou Fan and Yonghong Yao Department of Mathematics,
More informationIterative algorithms based on the hybrid steepest descent method for the split feasibility problem
Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 9 (206), 424 4225 Research Article Iterative algorithms based on the hybrid steepest descent method for the split feasibility problem Jong Soo
More informationON A HYBRID PROXIMAL POINT ALGORITHM IN BANACH SPACES
U.P.B. Sci. Bull., Series A, Vol. 80, Iss. 3, 2018 ISSN 1223-7027 ON A HYBRID PROXIMAL POINT ALGORITHM IN BANACH SPACES Vahid Dadashi 1 In this paper, we introduce a hybrid projection algorithm for a countable
More informationTHE CYCLIC DOUGLAS RACHFORD METHOD FOR INCONSISTENT FEASIBILITY PROBLEMS
THE CYCLIC DOUGLAS RACHFORD METHOD FOR INCONSISTENT FEASIBILITY PROBLEMS JONATHAN M. BORWEIN AND MATTHEW K. TAM Abstract. We analyse the behaviour of the newly introduced cyclic Douglas Rachford algorithm
More informationWEAK CONVERGENCE THEOREMS FOR EQUILIBRIUM PROBLEMS WITH NONLINEAR OPERATORS IN HILBERT SPACES
Fixed Point Theory, 12(2011), No. 2, 309-320 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html WEAK CONVERGENCE THEOREMS FOR EQUILIBRIUM PROBLEMS WITH NONLINEAR OPERATORS IN HILBERT SPACES S. DHOMPONGSA,
More informationA general iterative algorithm for equilibrium problems and strict pseudo-contractions in Hilbert spaces
A general iterative algorithm for equilibrium problems and strict pseudo-contractions in Hilbert spaces MING TIAN College of Science Civil Aviation University of China Tianjin 300300, China P. R. CHINA
More informationResearch Article Algorithms for a System of General Variational Inequalities in Banach Spaces
Journal of Applied Mathematics Volume 2012, Article ID 580158, 18 pages doi:10.1155/2012/580158 Research Article Algorithms for a System of General Variational Inequalities in Banach Spaces Jin-Hua Zhu,
More informationThe viscosity technique for the implicit midpoint rule of nonexpansive mappings in
Xu et al. Fixed Point Theory and Applications 05) 05:4 DOI 0.86/s3663-05-08-9 R E S E A R C H Open Access The viscosity technique for the implicit midpoint rule of nonexpansive mappings in Hilbert spaces
More informationStrong convergence theorems for asymptotically nonexpansive nonself-mappings with applications
Guo et al. Fixed Point Theory and Applications (2015) 2015:212 DOI 10.1186/s13663-015-0463-6 R E S E A R C H Open Access Strong convergence theorems for asymptotically nonexpansive nonself-mappings with
More informationShih-sen Chang, Yeol Je Cho, and Haiyun Zhou
J. Korean Math. Soc. 38 (2001), No. 6, pp. 1245 1260 DEMI-CLOSED PRINCIPLE AND WEAK CONVERGENCE PROBLEMS FOR ASYMPTOTICALLY NONEXPANSIVE MAPPINGS Shih-sen Chang, Yeol Je Cho, and Haiyun Zhou Abstract.
More informationResearch Article An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem
Abstract and Applied Analysis, Article ID 60813, 5 pages http://dx.doi.org/10.1155/014/60813 Research Article An Iterative Algorithm for the Split Equality and Multiple-Sets Split Equality Problem Luoyi
More informationMonotone variational inequalities, generalized equilibrium problems and fixed point methods
Wang Fixed Point Theory and Applications 2014, 2014:236 R E S E A R C H Open Access Monotone variational inequalities, generalized equilibrium problems and fixed point methods Shenghua Wang * * Correspondence:
More informationIterative common solutions of fixed point and variational inequality problems
Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 9 (2016), 1882 1890 Research Article Iterative common solutions of fixed point and variational inequality problems Yunpeng Zhang a, Qing Yuan b,
More informationFixed points of monotone mappings and application to integral equations
Bachar and Khamsi Fixed Point Theory and pplications (15) 15:11 DOI 1.1186/s13663-15-36-x RESERCH Open ccess Fixed points of monotone mappings and application to integral equations Mostafa Bachar1* and
More informationITERATIVE SCHEMES FOR APPROXIMATING SOLUTIONS OF ACCRETIVE OPERATORS IN BANACH SPACES SHOJI KAMIMURA AND WATARU TAKAHASHI. Received December 14, 1999
Scientiae Mathematicae Vol. 3, No. 1(2000), 107 115 107 ITERATIVE SCHEMES FOR APPROXIMATING SOLUTIONS OF ACCRETIVE OPERATORS IN BANACH SPACES SHOJI KAMIMURA AND WATARU TAKAHASHI Received December 14, 1999
More informationSTRONG CONVERGENCE THEOREMS BY A HYBRID STEEPEST DESCENT METHOD FOR COUNTABLE NONEXPANSIVE MAPPINGS IN HILBERT SPACES
Scientiae Mathematicae Japonicae Online, e-2008, 557 570 557 STRONG CONVERGENCE THEOREMS BY A HYBRID STEEPEST DESCENT METHOD FOR COUNTABLE NONEXPANSIVE MAPPINGS IN HILBERT SPACES SHIGERU IEMOTO AND WATARU
More informationThe Generalized Viscosity Implicit Rules of Asymptotically Nonexpansive Mappings in Hilbert Spaces
Applied Mathematical Sciences, Vol. 11, 2017, no. 12, 549-560 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.718 The Generalized Viscosity Implicit Rules of Asymptotically Nonexpansive
More informationHAIYUN ZHOU, RAVI P. AGARWAL, YEOL JE CHO, AND YONG SOO KIM
Georgian Mathematical Journal Volume 9 (2002), Number 3, 591 600 NONEXPANSIVE MAPPINGS AND ITERATIVE METHODS IN UNIFORMLY CONVEX BANACH SPACES HAIYUN ZHOU, RAVI P. AGARWAL, YEOL JE CHO, AND YONG SOO KIM
More informationIterative Convex Optimization Algorithms; Part One: Using the Baillon Haddad Theorem
Iterative Convex Optimization Algorithms; Part One: Using the Baillon Haddad Theorem Charles Byrne (Charles Byrne@uml.edu) http://faculty.uml.edu/cbyrne/cbyrne.html Department of Mathematical Sciences
More informationTwo-Step Iteration Scheme for Nonexpansive Mappings in Banach Space
Mathematica Moravica Vol. 19-1 (2015), 95 105 Two-Step Iteration Scheme for Nonexpansive Mappings in Banach Space M.R. Yadav Abstract. In this paper, we introduce a new two-step iteration process to approximate
More informationThe Split Hierarchical Monotone Variational Inclusions Problems and Fixed Point Problems for Nonexpansive Semigroup
International Mathematical Forum, Vol. 11, 2016, no. 8, 395-408 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2016.6220 The Split Hierarchical Monotone Variational Inclusions Problems and
More informationConvergence Theorems for Bregman Strongly Nonexpansive Mappings in Reflexive Banach Spaces
Filomat 28:7 (2014), 1525 1536 DOI 10.2298/FIL1407525Z Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Convergence Theorems for
More informationResearch Article Hybrid Algorithm of Fixed Point for Weak Relatively Nonexpansive Multivalued Mappings and Applications
Abstract and Applied Analysis Volume 2012, Article ID 479438, 13 pages doi:10.1155/2012/479438 Research Article Hybrid Algorithm of Fixed Point for Weak Relatively Nonexpansive Multivalued Mappings and
More informationSynchronal Algorithm For a Countable Family of Strict Pseudocontractions in q-uniformly Smooth Banach Spaces
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 15, 727-745 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.212287 Synchronal Algorithm For a Countable Family of Strict Pseudocontractions
More informationConvergence Theorems of Approximate Proximal Point Algorithm for Zeroes of Maximal Monotone Operators in Hilbert Spaces 1
Int. Journal of Math. Analysis, Vol. 1, 2007, no. 4, 175-186 Convergence Theorems of Approximate Proximal Point Algorithm for Zeroes of Maximal Monotone Operators in Hilbert Spaces 1 Haiyun Zhou Institute
More informationViscosity Iterative Approximating the Common Fixed Points of Non-expansive Semigroups in Banach Spaces
Viscosity Iterative Approximating the Common Fixed Points of Non-expansive Semigroups in Banach Spaces YUAN-HENG WANG Zhejiang Normal University Department of Mathematics Yingbing Road 688, 321004 Jinhua
More informationResearch Article Cyclic Iterative Method for Strictly Pseudononspreading in Hilbert Space
Journal of Applied Mathematics Volume 2012, Article ID 435676, 15 pages doi:10.1155/2012/435676 Research Article Cyclic Iterative Method for Strictly Pseudononspreading in Hilbert Space Bin-Chao Deng,
More informationResearch Article Strong Convergence of Cesàro Mean Iterations for Nonexpansive Nonself-Mappings in Banach Spaces
Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2007, Article ID 59262, 11 pages doi:10.1155/2007/59262 Research Article Strong Convergence of Cesàro Mean Iterations for Nonexpansive
More informationResearch Article Iterative Approximation of Common Fixed Points of Two Nonself Asymptotically Nonexpansive Mappings
Discrete Dynamics in Nature and Society Volume 2011, Article ID 487864, 16 pages doi:10.1155/2011/487864 Research Article Iterative Approximation of Common Fixed Points of Two Nonself Asymptotically Nonexpansive
More informationSTRONG CONVERGENCE OF AN IMPLICIT ITERATION PROCESS FOR ASYMPTOTICALLY NONEXPANSIVE IN THE INTERMEDIATE SENSE MAPPINGS IN BANACH SPACES
Kragujevac Journal of Mathematics Volume 36 Number 2 (2012), Pages 237 249. STRONG CONVERGENCE OF AN IMPLICIT ITERATION PROCESS FOR ASYMPTOTICALLY NONEXPANSIVE IN THE INTERMEDIATE SENSE MAPPINGS IN BANACH
More informationResearch Article Generalized Mann Iterations for Approximating Fixed Points of a Family of Hemicontractions
Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 008, Article ID 84607, 9 pages doi:10.1155/008/84607 Research Article Generalized Mann Iterations for Approximating Fixed Points
More informationViscosity approximation methods for the implicit midpoint rule of asymptotically nonexpansive mappings in Hilbert spaces
Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 9 016, 4478 4488 Research Article Viscosity approximation methods for the implicit midpoint rule of asymptotically nonexpansive mappings in Hilbert
More informationThe Journal of Nonlinear Science and Applications
J. Nonlinear Sci. Appl. 2 (2009), no. 2, 78 91 The Journal of Nonlinear Science and Applications http://www.tjnsa.com STRONG CONVERGENCE THEOREMS FOR EQUILIBRIUM PROBLEMS AND FIXED POINT PROBLEMS OF STRICT
More informationA NEW COMPOSITE IMPLICIT ITERATIVE PROCESS FOR A FINITE FAMILY OF NONEXPANSIVE MAPPINGS IN BANACH SPACES
A NEW COMPOSITE IMPLICIT ITERATIVE PROCESS FOR A FINITE FAMILY OF NONEXPANSIVE MAPPINGS IN BANACH SPACES FENG GU AND JING LU Received 18 January 2006; Revised 22 August 2006; Accepted 23 August 2006 The
More informationStrong Convergence Theorem by a Hybrid Extragradient-like Approximation Method for Variational Inequalities and Fixed Point Problems
Strong Convergence Theorem by a Hybrid Extragradient-like Approximation Method for Variational Inequalities and Fixed Point Problems Lu-Chuan Ceng 1, Nicolas Hadjisavvas 2 and Ngai-Ching Wong 3 Abstract.
More informationA NEW ITERATIVE METHOD FOR THE SPLIT COMMON FIXED POINT PROBLEM IN HILBERT SPACES. Fenghui Wang
A NEW ITERATIVE METHOD FOR THE SPLIT COMMON FIXED POINT PROBLEM IN HILBERT SPACES Fenghui Wang Department of Mathematics, Luoyang Normal University, Luoyang 470, P.R. China E-mail: wfenghui@63.com ABSTRACT.
More informationCONVERGENCE OF HYBRID FIXED POINT FOR A PAIR OF NONLINEAR MAPPINGS IN BANACH SPACES
International Journal of Analysis and Applications ISSN 2291-8639 Volume 8, Number 1 2015), 69-78 http://www.etamaths.com CONVERGENCE OF HYBRID FIXED POINT FOR A PAIR OF NONLINEAR MAPPINGS IN BANACH SPACES
More informationA General Iterative Method for Constrained Convex Minimization Problems in Hilbert Spaces
A General Iterative Method for Constrained Convex Minimization Problems in Hilbert Spaces MING TIAN Civil Aviation University of China College of Science Tianjin 300300 CHINA tianming963@6.com MINMIN LI
More informationResearch Article Some Krasnonsel skiĭ-mann Algorithms and the Multiple-Set Split Feasibility Problem
Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2010, Article ID 513956, 12 pages doi:10.1155/2010/513956 Research Article Some Krasnonsel skiĭ-mann Algorithms and the Multiple-Set
More informationThe Mild Modification of the (DL)-Condition and Fixed Point Theorems for Some Generalized Nonexpansive Mappings in Banach Spaces
Int. Journal of Math. Analysis, Vol. 6, 2012, no. 19, 933-940 The Mild Modification of the (DL)-Condition and Fixed Point Theorems for Some Generalized Nonexpansive Mappings in Banach Spaces Kanok Chuikamwong
More informationA regularization projection algorithm for various problems with nonlinear mappings in Hilbert spaces
Bin Dehaish et al. Journal of Inequalities and Applications (2015) 2015:51 DOI 10.1186/s13660-014-0541-z R E S E A R C H Open Access A regularization projection algorithm for various problems with nonlinear
More informationStrong Convergence of Two Iterative Algorithms for a Countable Family of Nonexpansive Mappings in Hilbert Spaces
International Mathematical Forum, 5, 2010, no. 44, 2165-2172 Strong Convergence of Two Iterative Algorithms for a Countable Family of Nonexpansive Mappings in Hilbert Spaces Jintana Joomwong Division of
More informationCONVERGENCE THEOREMS FOR STRICTLY ASYMPTOTICALLY PSEUDOCONTRACTIVE MAPPINGS IN HILBERT SPACES. Gurucharan Singh Saluja
Opuscula Mathematica Vol 30 No 4 2010 http://dxdoiorg/107494/opmath2010304485 CONVERGENCE THEOREMS FOR STRICTLY ASYMPTOTICALLY PSEUDOCONTRACTIVE MAPPINGS IN HILBERT SPACES Gurucharan Singh Saluja Abstract
More informationSTRONG CONVERGENCE THEOREMS FOR COMMUTATIVE FAMILIES OF LINEAR CONTRACTIVE OPERATORS IN BANACH SPACES
STRONG CONVERGENCE THEOREMS FOR COMMUTATIVE FAMILIES OF LINEAR CONTRACTIVE OPERATORS IN BANACH SPACES WATARU TAKAHASHI, NGAI-CHING WONG, AND JEN-CHIH YAO Abstract. In this paper, we study nonlinear analytic
More informationCommon fixed points of two generalized asymptotically quasi-nonexpansive mappings
An. Ştiinţ. Univ. Al. I. Cuza Iaşi. Mat. (N.S.) Tomul LXIII, 2017, f. 2 Common fixed points of two generalized asymptotically quasi-nonexpansive mappings Safeer Hussain Khan Isa Yildirim Received: 5.VIII.2013
More informationA Direct Proof of Caristi s Fixed Point Theorem
Applied Mathematical Sciences, Vol. 10, 2016, no. 46, 2289-2294 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.66190 A Direct Proof of Caristi s Fixed Point Theorem Wei-Shih Du Department
More informationOn an iterative algorithm for variational inequalities in. Banach space
MATHEMATICAL COMMUNICATIONS 95 Math. Commun. 16(2011), 95 104. On an iterative algorithm for variational inequalities in Banach spaces Yonghong Yao 1, Muhammad Aslam Noor 2,, Khalida Inayat Noor 3 and
More informationKrasnoselskii type algorithm for zeros of strongly monotone Lipschitz maps in classical banach spaces
DOI 10.1186/s40064-015-1044-1 RESEARCH Krasnoselskii type algorithm for zeros of strongly monotone Lipschitz maps in classical banach spaces Open Access C E Chidume 1*, A U Bello 1, and B Usman 1 *Correspondence:
More informationModified semi-implicit midpoint rule for nonexpansive mappings
Yao et al. Fixed Point Theory and Applications 015) 015:166 DOI 10.1186/s13663-015-0414- R E S E A R C H Open Access Modified semi-implicit midpoint rule for nonexpansive mappings Yonghong Yao 1, Naseer
More informationAvailable online at J. Nonlinear Sci. Appl., 10 (2017), Research Article
Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 10 (2017), 2719 2726 Research Article Journal Homepage: www.tjnsa.com - www.isr-publications.com/jnsa An affirmative answer to
More informationSome unified algorithms for finding minimum norm fixed point of nonexpansive semigroups in Hilbert spaces
An. Şt. Univ. Ovidius Constanţa Vol. 19(1), 211, 331 346 Some unified algorithms for finding minimum norm fixed point of nonexpansive semigroups in Hilbert spaces Yonghong Yao, Yeong-Cheng Liou Abstract
More informationA New Modified Gradient-Projection Algorithm for Solution of Constrained Convex Minimization Problem in Hilbert Spaces
A New Modified Gradient-Projection Algorithm for Solution of Constrained Convex Minimization Problem in Hilbert Spaces Cyril Dennis Enyi and Mukiawa Edwin Soh Abstract In this paper, we present a new iterative
More informationRegularization proximal point algorithm for finding a common fixed point of a finite family of nonexpansive mappings in Banach spaces
RESEARCH Open Access Regularization proximal point algorithm for finding a common fixed point of a finite family of nonexpansive mappings in Banach spaces Jong Kyu Kim 1* and Truong Minh Tuyen 2 * Correspondence:
More informationResearch Article On Multivalued Nonexpansive Mappings in R-Trees
Applied Mathematics Volume 2012, Article ID 629149, 13 pages doi:10.1155/2012/629149 Research Article On Multivalued Nonexpansive Mappings in R-Trees K. Samanmit and B. Panyanak Department of Mathematics,
More informationNew hybrid conjugate gradient methods with the generalized Wolfe line search
Xu and Kong SpringerPlus (016)5:881 DOI 10.1186/s40064-016-5-9 METHODOLOGY New hybrid conjugate gradient methods with the generalized Wolfe line search Open Access Xiao Xu * and Fan yu Kong *Correspondence:
More informationITERATIVE ALGORITHMS WITH ERRORS FOR ZEROS OF ACCRETIVE OPERATORS IN BANACH SPACES. Jong Soo Jung. 1. Introduction
J. Appl. Math. & Computing Vol. 20(2006), No. 1-2, pp. 369-389 Website: http://jamc.net ITERATIVE ALGORITHMS WITH ERRORS FOR ZEROS OF ACCRETIVE OPERATORS IN BANACH SPACES Jong Soo Jung Abstract. The iterative
More informationWeak and strong convergence theorems of modified SP-iterations for generalized asymptotically quasi-nonexpansive mappings
Mathematica Moravica Vol. 20:1 (2016), 125 144 Weak and strong convergence theorems of modified SP-iterations for generalized asymptotically quasi-nonexpansive mappings G.S. Saluja Abstract. The aim of
More informationRATES OF CONVERGENCE FOR A CLASS OF GENERALIZED QUASI CONTRACTIVE MAPPINGS IN KOHLENBACH HYPERBOLIC SPACES
U.P.B. Sci. Bull. Series A, Vol. 81, Iss1, 2019 ISSN 1223-7027 RATES OF CONVERGENCE FOR A CLASS OF GENERALIZED QUASI CONTRACTIVE MAPPINGS IN KOHLENBACH HYPERBOLIC SPACES Zahid AKHTAR 1 and Muhammad Aqeel
More informationStrong convergence theorems for two total asymptotically nonexpansive nonself mappings in Banach spaces
Kiziltunc and Yolacan Fixed Point Theory and Applications 2013, 2013:90 R E S E A R C H Open Access Strong convergence theorems for two total asymptotically nonexpansive nonself mappings in Banach spaces
More informationStrong convergence theorems for total quasi-ϕasymptotically
RESEARCH Open Access Strong convergence theorems for total quasi-ϕasymptotically nonexpansive multi-valued mappings in Banach spaces Jinfang Tang 1 and Shih-sen Chang 2* * Correspondence: changss@yahoo.
More informationBest Approximation to Common Fixed Points of A Semigroup of Nonexpansive Operators
Best Approximation to Common Fixed Points of A Semigroup of Nonexpansive Operators Arkady Aleyner (aaleyner@netvision.net.il) and Yair Censor (yair@math.haifa.ac.il) Department of Mathematics, University
More informationOn the Weak Convergence of the Extragradient Method for Solving Pseudo-Monotone Variational Inequalities
J Optim Theory Appl 208) 76:399 409 https://doi.org/0.007/s0957-07-24-0 On the Weak Convergence of the Extragradient Method for Solving Pseudo-Monotone Variational Inequalities Phan Tu Vuong Received:
More informationFIXED POINT ITERATION FOR PSEUDOCONTRACTIVE MAPS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 127, Number 4, April 1999, Pages 1163 1170 S 0002-9939(99)05050-9 FIXED POINT ITERATION FOR PSEUDOCONTRACTIVE MAPS C. E. CHIDUME AND CHIKA MOORE
More informationOn the S-Iteration Processes for Multivalued Mappings in Some CAT(κ) Spaces
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 18, 857-864 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.4375 On the S-Iteration Processes for Multivalued Mappings in Some CAT(κ)
More informationStrong convergence to a common fixed point. of nonexpansive mappings semigroups
Theoretical Mathematics & Applications, vol.3, no., 23, 35-45 ISSN: 792-9687 (print), 792-979 (online) Scienpress Ltd, 23 Strong convergence to a common fixed point of nonexpansive mappings semigroups
More informationPROXIMAL POINT ALGORITHMS INVOLVING FIXED POINT OF NONSPREADING-TYPE MULTIVALUED MAPPINGS IN HILBERT SPACES
PROXIMAL POINT ALGORITHMS INVOLVING FIXED POINT OF NONSPREADING-TYPE MULTIVALUED MAPPINGS IN HILBERT SPACES Shih-sen Chang 1, Ding Ping Wu 2, Lin Wang 3,, Gang Wang 3 1 Center for General Educatin, China
More informationGENERAL NONCONVEX SPLIT VARIATIONAL INEQUALITY PROBLEMS. Jong Kyu Kim, Salahuddin, and Won Hee Lim
Korean J. Math. 25 (2017), No. 4, pp. 469 481 https://doi.org/10.11568/kjm.2017.25.4.469 GENERAL NONCONVEX SPLIT VARIATIONAL INEQUALITY PROBLEMS Jong Kyu Kim, Salahuddin, and Won Hee Lim Abstract. In this
More informationarxiv: v1 [math.oc] 20 Sep 2016
General Viscosity Implicit Midpoint Rule For Nonexpansive Mapping Shuja Haider Rizvi Department of Mathematics, Babu Banarasi Das University, Lucknow 68, India arxiv:169.616v1 [math.oc] Sep 16 Abstract:
More informationResearch Article Remarks on Asymptotic Centers and Fixed Points
Abstract and Applied Analysis Volume 2010, Article ID 247402, 5 pages doi:10.1155/2010/247402 Research Article Remarks on Asymptotic Centers and Fixed Points A. Kaewkhao 1 and K. Sokhuma 2 1 Department
More informationWEAK CONVERGENCE OF RESOLVENTS OF MAXIMAL MONOTONE OPERATORS AND MOSCO CONVERGENCE
Fixed Point Theory, Volume 6, No. 1, 2005, 59-69 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.htm WEAK CONVERGENCE OF RESOLVENTS OF MAXIMAL MONOTONE OPERATORS AND MOSCO CONVERGENCE YASUNORI KIMURA Department
More informationConvergence to Common Fixed Point for Two Asymptotically Quasi-nonexpansive Mappings in the Intermediate Sense in Banach Spaces
Mathematica Moravica Vol. 19-1 2015, 33 48 Convergence to Common Fixed Point for Two Asymptotically Quasi-nonexpansive Mappings in the Intermediate Sense in Banach Spaces Gurucharan Singh Saluja Abstract.
More informationOn nonexpansive and accretive operators in Banach spaces
Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 10 (2017), 3437 3446 Research Article Journal Homepage: www.tjnsa.com - www.isr-publications.com/jnsa On nonexpansive and accretive
More informationExistence and Approximation of Fixed Points of. Bregman Nonexpansive Operators. Banach Spaces
Existence and Approximation of Fixed Points of in Reflexive Banach Spaces Department of Mathematics The Technion Israel Institute of Technology Haifa 22.07.2010 Joint work with Prof. Simeon Reich General
More informationA FIXED POINT THEOREM FOR GENERALIZED NONEXPANSIVE MULTIVALUED MAPPINGS
Fixed Point Theory, (0), No., 4-46 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html A FIXED POINT THEOREM FOR GENERALIZED NONEXPANSIVE MULTIVALUED MAPPINGS A. ABKAR AND M. ESLAMIAN Department of Mathematics,
More informationSTRONG CONVERGENCE OF AN ITERATIVE METHOD FOR VARIATIONAL INEQUALITY PROBLEMS AND FIXED POINT PROBLEMS
ARCHIVUM MATHEMATICUM (BRNO) Tomus 45 (2009), 147 158 STRONG CONVERGENCE OF AN ITERATIVE METHOD FOR VARIATIONAL INEQUALITY PROBLEMS AND FIXED POINT PROBLEMS Xiaolong Qin 1, Shin Min Kang 1, Yongfu Su 2,
More informationTHROUGHOUT this paper, we let C be a nonempty
Strong Convergence Theorems of Multivalued Nonexpansive Mappings and Maximal Monotone Operators in Banach Spaces Kriengsak Wattanawitoon, Uamporn Witthayarat and Poom Kumam Abstract In this paper, we prove
More informationResearch Article Convergence Theorems for Common Fixed Points of Nonself Asymptotically Quasi-Non-Expansive Mappings
Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2008, Article ID 428241, 11 pages doi:10.1155/2008/428241 Research Article Convergence Theorems for Common Fixed Points of Nonself
More informationOn a result of Pazy concerning the asymptotic behaviour of nonexpansive mappings
On a result of Pazy concerning the asymptotic behaviour of nonexpansive mappings arxiv:1505.04129v1 [math.oc] 15 May 2015 Heinz H. Bauschke, Graeme R. Douglas, and Walaa M. Moursi May 15, 2015 Abstract
More informationWEAK AND STRONG CONVERGENCE OF AN ITERATIVE METHOD FOR NONEXPANSIVE MAPPINGS IN HILBERT SPACES
Applicable Analysis and Discrete Mathematics available online at http://pemath.et.b.ac.yu Appl. Anal. Discrete Math. 2 (2008), 197 204. doi:10.2298/aadm0802197m WEAK AND STRONG CONVERGENCE OF AN ITERATIVE
More informationViscosity Approximative Methods for Nonexpansive Nonself-Mappings without Boundary Conditions in Banach Spaces
Applied Mathematical Sciences, Vol. 2, 2008, no. 22, 1053-1062 Viscosity Approximative Methods for Nonexpansive Nonself-Mappings without Boundary Conditions in Banach Spaces Rabian Wangkeeree and Pramote
More informationDepartment of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand
Hindawi Publishing Corporation Abstract and Applied Analysis Volume 2009, Article ID 728510, 14 pages doi:10.1155/2009/728510 Research Article Common Fixed Points of Multistep Noor Iterations with Errors
More informationON THE STRUCTURE OF FIXED-POINT SETS OF UNIFORMLY LIPSCHITZIAN MAPPINGS. Ewa Sędłak Andrzej Wiśnicki. 1. Introduction
Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 30, 2007, 345 350 ON THE STRUCTURE OF FIXED-POINT SETS OF UNIFORMLY LIPSCHITZIAN MAPPINGS Ewa Sędłak Andrzej Wiśnicki
More informationSHRINKING PROJECTION METHOD FOR A SEQUENCE OF RELATIVELY QUASI-NONEXPANSIVE MULTIVALUED MAPPINGS AND EQUILIBRIUM PROBLEM IN BANACH SPACES
U.P.B. Sci. Bull., Series A, Vol. 76, Iss. 2, 2014 ISSN 1223-7027 SHRINKING PROJECTION METHOD FOR A SEQUENCE OF RELATIVELY QUASI-NONEXPANSIVE MULTIVALUED MAPPINGS AND EQUILIBRIUM PROBLEM IN BANACH SPACES
More informationVariational inequalities for fixed point problems of quasi-nonexpansive operators 1. Rafał Zalas 2
University of Zielona Góra Faculty of Mathematics, Computer Science and Econometrics Summary of the Ph.D. thesis Variational inequalities for fixed point problems of quasi-nonexpansive operators 1 by Rafał
More informationCONVERGENCE OF APPROXIMATING FIXED POINTS FOR MULTIVALUED NONSELF-MAPPINGS IN BANACH SPACES. Jong Soo Jung. 1. Introduction
Korean J. Math. 16 (2008), No. 2, pp. 215 231 CONVERGENCE OF APPROXIMATING FIXED POINTS FOR MULTIVALUED NONSELF-MAPPINGS IN BANACH SPACES Jong Soo Jung Abstract. Let E be a uniformly convex Banach space
More informationResearch Article Iterative Approximation of a Common Zero of a Countably Infinite Family of m-accretive Operators in Banach Spaces
Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2008, Article ID 325792, 13 pages doi:10.1155/2008/325792 Research Article Iterative Approximation of a Common Zero of a Countably
More informationConvergence theorems for a finite family. of nonspreading and nonexpansive. multivalued mappings and equilibrium. problems with application
Theoretical Mathematics & Applications, vol.3, no.3, 2013, 49-61 ISSN: 1792-9687 (print), 1792-9709 (online) Scienpress Ltd, 2013 Convergence theorems for a finite family of nonspreading and nonexpansive
More informationResearch Article Approximating Fixed Points of Some Maps in Uniformly Convex Metric Spaces
Hindawi Publishing Corporation Fixed Point Theory and Applications Volume 2010, Article ID 385986, 11 pages doi:10.1155/2010/385986 Research Article Approximating Fixed Points of Some Maps in Uniformly
More informationCONVERGENCE THEOREMS FOR MULTI-VALUED MAPPINGS. 1. Introduction
CONVERGENCE THEOREMS FOR MULTI-VALUED MAPPINGS YEKINI SHEHU, G. C. UGWUNNADI Abstract. In this paper, we introduce a new iterative process to approximate a common fixed point of an infinite family of multi-valued
More informationHybrid Steepest Descent Method for Variational Inequality Problem over Fixed Point Sets of Certain Quasi-Nonexpansive Mappings
Hybrid Steepest Descent Method for Variational Inequality Problem over Fixed Point Sets of Certain Quasi-Nonexpansive Mappings Isao Yamada Tokyo Institute of Technology VIC2004 @ Wellington, Feb. 13, 2004
More informationOn non-expansivity of topical functions by a new pseudo-metric
https://doi.org/10.1007/s40065-018-0222-8 Arabian Journal of Mathematics H. Barsam H. Mohebi On non-expansivity of topical functions by a new pseudo-metric Received: 9 March 2018 / Accepted: 10 September
More informationCaristi-type Fixed Point Theorem of Set-Valued Maps in Metric Spaces
International Journal of Mathematical Analysis Vol. 11, 2017, no. 6, 267-275 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.717 Caristi-type Fixed Point Theorem of Set-Valued Maps in Metric
More informationThe Split Common Fixed Point Problem for Asymptotically Quasi-Nonexpansive Mappings in the Intermediate Sense
International Mathematical Forum, Vol. 8, 2013, no. 25, 1233-1241 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2013.3599 The Split Common Fixed Point Problem for Asymptotically Quasi-Nonexpansive
More informationFixed point theorem for generalized weak contractions satisfying rational expressions in ordered metric spaces
RESEARCH Open Access Fixed point theorem for generalized weak contractions satisfying rational expressions in ordered metric spaces Nguyen Van Luong * and Nguyen Xuan Thuan * Correspondence: luonghdu@gmail.com
More informationFIXED POINTS OF MULTIVALUED MAPPINGS IN CERTAIN CONVEX METRIC SPACES. Tomoo Shimizu Wataru Takahashi. 1. Introduction
Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 8, 1996, 197 203 FIXED POINTS OF MULTIVALUED MAPPINGS IN CERTAIN CONVEX METRIC SPACES Tomoo Shimizu Wataru Takahashi
More information