- Open Access
Approximate solutions to variational inequality over the fixed point set of a strongly nonexpansive mapping
© Iemoto et al.; licensee Springer. 2014
- Received: 3 September 2013
- Accepted: 13 February 2014
- Published: 25 February 2014
Variational inequality problems over fixed point sets of nonexpansive mappings include many practical problems in engineering and applied mathematics, and a number of iterative methods have been presented to solve them. In this paper, we discuss a variational inequality problem for a monotone, hemicontinuous operator over the fixed point set of a strongly nonexpansive mapping on a real Hilbert space. We then present an iterative algorithm, which uses the strongly nonexpansive mapping at each iteration, for solving the problem. We show that the algorithm potentially converges in the fixed point set faster than algorithms using firmly nonexpansive mappings. We also prove that, under certain assumptions, the algorithm with slowly diminishing step-size sequences converges to a solution to the problem in the sense of the weak topology of a Hilbert space. Numerical results demonstrate that the algorithm converges to a solution to a concrete variational inequality problem faster than the previous algorithm.
MSC:47H06, 47J20, 47J25.
- variational inequality problem
- fixed point set
- strongly nonexpansive mapping
- monotone operator
when is strongly monotone and Lipschitz continuous. Problem (2) contains many applications such as signal recovery problems , beam-forming problems , power-control problems [13, 14], bandwidth allocation problems [15–17], and optimal control problems . References [11, 19], and  presented acceleration methods for solving Problem (2) when A is strongly monotone and Lipschitz continuous. Algorithms were presented to solve Problem (2) when A is (strictly) monotone and Lipschitz continuous [15, 17]. When and is continuous (and is not necessarily monotone), a simple algorithm, (), was presented in  and the algorithm converges to a solution to Problem (2) under some conditions.
Algorithm (5) potentially converges in the fixed point set faster than algorithm (4). Here, we can see that the mapping, , satisfies the strong nonexpansivity condition , which is a weaker condition than firm nonexpansivity. This implies that the previous algorithms in [14, 21], which can be applied to Problem (2) when T is firmly nonexpansive, cannot solve Problem (2) when T is strongly nonexpansive.
In this paper, we present an iterative algorithm for solving the variational inequality problem with a monotone, hemicontinuous operator over the fixed point set of a strongly nonexpansive mapping and show that the algorithm weakly converges to a solution to the problem under certain assumptions.
The rest of the paper is organized as follows. Section 2 covers the mathematical preliminaries. Section 3 presents the algorithm for solving the variational inequality problem for a monotone, hemicontinuous operator over the fixed point set of a strongly nonexpansive mapping, and its convergence analyses. Section 4 provides numerical comparisons of the algorithm with the previous algorithm in  and shows that the algorithm converges to a solution to a concrete variational inequality problem faster than the previous algorithm. Section 5 concludes the paper.
Throughout this paper, we will denote the set of all positive integers by ℕ and the set of all real numbers by ℝ. Let H be a real Hilbert space with inner product and its induced norm . We denote the strong convergence and weak convergence of to by and , respectively. It is well known that H satisfies the following condition, called Opial’s condition : for any satisfying , holds for all with ; see also [5, 6, 24]. To prove our main theorems, we need the following lemma, which was proven in ; see also [5, 6, 26].
Lemma 2.1 ()
Assume that and are sequences of non-negative numbers such that for all . If , then exists.
2.1 Strong nonexpansivity and fixed point set
Let T be a mapping of H into itself. We denote the fixed point set of T by ; i.e., . A mapping is said to be nonexpansive if for all . is closed and convex when T is nonexpansive [5, 6, 24, 27]. is said to be strongly nonexpansive  if T is nonexpansive and if, for bounded sequences , implies . The following properties for strongly nonexpansive mappings were shown in :
is closed and convex when is strongly nonexpansive because T is also nonexpansive.
If are strongly nonexpansive, then ST is also strongly nonexpansive, and when .
If is strongly nonexpansive and if is nonexpansive, then is strongly nonexpansive for . If , then . In particular, since the identity mapping I is strongly nonexpansive, the mapping is strongly nonexpansive. Such U is said to be averaged nonexpansive.
Then T is strongly nonexpansive and .
Then S is nonexpansive [, Proposition 4.2] and . Hence, T is strongly nonexpansive and . is referred to as a generalized convex feasible set [10, 32] and is defined as the subset of that is closest to in the mean square sense. Even if , is well defined. holds when . Accordingly, is a generalization of .
A mapping is said to be firmly nonexpansive  if for all (see also [24, 27, 34]). Every firmly nonexpansive mapping F can be expressed as given some nonexpansive mapping T [24, 27, 34]. Hence, the class of averaged nonexpansive mappings includes the class of firmly nonexpansive mappings.
2.2 Variational inequality
We denote the solution set of the variational inequality problem by . The monotonicity and hemicontinuity of A imply that [, Subsection 7.1]. This means that is closed and convex. is nonempty when is monotone and hemicontinuous, and is nonempty, compact, and convex [, Theorem 7.1.8].
Example 2.3 Let be convex and continuously Fréchet differentiable and . Then A is monotone and hemicontinuous.
In this section, we present an iterative algorithm for solving the variational inequality problem for a monotone, hemicontinuous operator over the fixed point set of a strongly nonexpansive mapping and its convergence analyses. We assume that is a strongly nonexpansive mapping with and that is a monotone, hemicontinuous operator.
Step 0. Choose , , and arbitrarily, and let .
Step 2. Update , and go to Step 1.
To prove our main theorems, we need the following lemma.
, , and the existence of an satisfying .
Then is bounded.
From , the boundedness of , and Lemma 2.1, the limit of exists for all , which implies that is bounded.
Hence, the condition, , and Lemma 2.1 guarantee that the limit of exists for all . We thus conclude that is bounded. □
Now, we are in the position to perform the convergence analysis on Algorithm 3.1 under condition (A) in Lemma 3.1.
Then Algorithm 3.1 converges weakly to a point in .
Prove that and are bounded.
Prove that and hold.
Prove that converges weakly to a point in .
Choose arbitrarily. From the inequality, , and Lemma 3.1, we deduce that is bounded.
- (b)Put for any . Then, from , for any , we can choose such that , and for all . Also, there exists such that for all because of . Since , we have
- (c)From the boundedness of , there exists a subsequence of such that converges weakly to a point . From the nonexpansivity of T and (12), it is guaranteed that T is demiclosed (i.e., and imply ). Hence, we have . From (9), we get, for any and for any ,
This is a contradiction. Thus, . This implies that every subsequence of converges weakly to the same point in . Therefore, converges weakly to . This completes the proof. □
Remark 3.2 If the sequence satisfies the assumptions in Theorem 3.1, we need not assume that or that exists such that in condition (B) (see also [, Remark 7(c)]).
instead of in Algorithm 3.1. Since and V is bounded, is bounded. The Lipschitz continuity of A means that (), where L (>0) is a constant, and hence, is bounded. We can prove that Algorithm 3.1 with Equation (13) and and satisfying the conditions in Theorem 3.1 (or Theorem 3.2) weakly converges to a point in by referring to the proof of Theorem 3.1 (or Theorem 3.2).
We prove the following theorem under condition (B) in Lemma 3.1. The essential parts of a proof are similar those of Lemma 3.1 and Theorem 3.1, so we will only give an outline of the proof below.
If and if there exists such that , then the sequence converges weakly to a point in .
Prove that and are bounded.
Prove that holds.
Prove that converges weakly to a point in .
From Lemma 3.1, it follows that the limit of exists for all , and hence and are bounded.
- (b)Let and put . Since , the condition, , holds. As in the proof of Theorem 3.1(b), for any , there exists such that
Following the proof of Theorem 3.1(c), there exists a subsequence such that converges weakly to . Assume that another subsequence of converges weakly to w. Then we also have . Since the limit of exists for , Opial’s theorem  guarantees that . This implies that every subsequence of converges weakly to the same point in , and hence, converges weakly to . This completes the proof. □
As we mentioned in Section 1, to solve constrained optimization problems whose feasible set is the fixed point set of a nonexpansive mapping T, Algorithm 3.1 must converge in early in the execution. Therefore, it would be useful to use a large parameter α () when a strongly nonexpansive mapping is represented by . Theorem 3.1 has the following consequences.
Then converges weakly to a point in .
Proof Since every averaged nonexpansive mapping is strongly nonexpansive and for , Theorem 3.1 implies Corollary 3.1. □
By following the proof of Theorem 3.2 and Corollary 3.1, we get the following.
If and if there exists such that , then converges weakly to a point in .
Let us apply Algorithm 3.1 and the algorithm in  to the following variational inequality problem.
where is positive semidefinite, , and (). Find .
We set Q as a diagonal matrix with diagonal components and choose (, ) to be Mersenne Twister pseudo-random numbers given by the random-real function of srfi-27, Gauche.a We also set and . The compiler used in this experiment was gcc.b The double-precision floating points were used for arithmetic processing of real numbers. The language was C.
The convergence of to 0 implies that algorithm (15) converges to a point in .
to check that algorithm (15) is stable.
We studied a variational inequality problem for a monotone, hemicontinuous operator over the fixed point set of a strongly nonexpansive mapping in a Hilbert space and devised an iterative algorithm for solving it. Our convergence analyses guarantee that the algorithm weakly converges to a solution under certain assumptions. We gave numerical results to support the convergence analyses on the algorithm. The results showed that the algorithm converges to a solution to a concrete variational inequality problem faster than the previous algorithm.
We used the Gauche scheme shell, 0.9.3.3 [utf-8,pthreads], x86_64-apple-darwin12.4.1.
We used gcc version 4.2.1 (Based on Apple Inc. build 5658) (LLVM build 2336.11.00).
For example, we set a large parameter, i.e., much more than : .
We are sincerely grateful to the Lead Guest Editor, Qamrul Hasan Ansari, of Special Issue on Variational Analysis and Fixed Point Theory: Dedicated to Professor Wataru Takahashi on the occasion of his 70th birthday, and the two anonymous referees for helping us improve the original manuscript. This work was supported by the Japan Society for the Promotion of Science through a Grant-in-Aid for JSPS Fellows (08J08592) and a Grant-in-Aid for Young Scientists (B) (23760077).
- Kinderlehrer D, Stampacchia G: An Introduction to Variational Inequalities and Their Applications. Academic Press, New York; 1980.Google Scholar
- Lions J-L, Stampacchia G: Variational inequalities. Commun. Pure Appl. Math. 1967, 20: 493–519. 10.1002/cpa.3160200302View ArticleMathSciNetGoogle Scholar
- Rockafellar RT, Wets RJ-B: Variational Analysis. Springer, Berlin; 1998.View ArticleGoogle Scholar
- Stampacchia G: Formes bilinéaires coercitives sur les ensembles convexes. C. R. Math. Acad. Sci. Paris 1964, 258: 4413–4416.MathSciNetGoogle Scholar
- Takahashi W: Nonlinear Functional Analysis. Fixed Point Theory and Its Applications. Yokohama Publishers, Yokohama; 2000.Google Scholar
- Takahashi W: Introduction to Nonlinear and Convex Analysis. Yokohama Publishers, Yokohama; 2009.Google Scholar
- Zeidler E: Nonlinear Functional Analysis and Its Applications. II/B. Springer, New York; 1990.View ArticleGoogle Scholar
- Zeidler E: Nonlinear Functional Analysis and Its Applications. III. Springer, New York; 1985.View ArticleGoogle Scholar
- Goldstein AA: Convex programming in Hilbert space. Bull. Am. Math. Soc. 1964, 70: 709–710. 10.1090/S0002-9904-1964-11178-2View ArticleGoogle Scholar
- Yamada I: The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings. Stud. Comput. Math. 8. In Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications. North-Holland, Amsterdam; 2001:473–504.View ArticleGoogle Scholar
- Combettes PL: A block-iterative surrogate constraint splitting method for quadratic signal recovery. IEEE Trans. Signal Process. 2003, 51: 1771–1782. 10.1109/TSP.2003.812846View ArticleMathSciNetGoogle Scholar
- Slavakis K, Yamada I: Robust wideband beamforming by the hybrid steepest descent method. IEEE Trans. Signal Process. 2007, 55: 4511–4522.View ArticleMathSciNetGoogle Scholar
- Iiduka H, Yamada I: An ergodic algorithm for the power-control games for CDMA data networks. J. Math. Model. Algorithms 2009, 8: 1–18. 10.1007/s10852-008-9099-4View ArticleMathSciNetGoogle Scholar
- Iiduka H: Fixed point optimization algorithm and its application to power control in CDMA data networks. Math. Program. 2012, 133: 227–242. 10.1007/s10107-010-0427-xView ArticleMathSciNetGoogle Scholar
- Iiduka H: Fixed point optimization algorithm and its application to network bandwidth allocation. J. Comput. Appl. Math. 2012, 236: 1733–1742. 10.1016/j.cam.2011.10.004View ArticleMathSciNetGoogle Scholar
- Iiduka H: Iterative algorithm for triple-hierarchical constrained nonconvex optimization problem and its application to network bandwidth allocation. SIAM J. Optim. 2012, 22: 862–878. 10.1137/110849456View ArticleMathSciNetGoogle Scholar
- Iiduka H: Fixed point optimization algorithms for distributed optimization in networked systems. SIAM J. Optim. 2013, 23: 1–26. 10.1137/120866877View ArticleMathSciNetGoogle Scholar
- Iiduka H, Yamada I: Computational method for solving a stochastic linear-quadratic control problem given an unsolvable stochastic algebraic Riccati equation. SIAM J. Control Optim. 2012, 50: 2173–2192. 10.1137/110850542View ArticleMathSciNetGoogle Scholar
- Iiduka H: Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping. Math. Program. 2014. 10.1007/s10107-013-0741-1Google Scholar
- 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. 2009, 19: 1881–1893. 10.1137/070702497View ArticleMathSciNetGoogle Scholar
- Iiduka H: A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping. Optimization 2010, 59: 873–885. 10.1080/02331930902884158View ArticleMathSciNetGoogle Scholar
- Bruck RE, Reich S: Nonexpansive projections and resolvents of accretive operators in Banach spaces. Houst. J. Math. 1977, 3: 459–470.MathSciNetGoogle Scholar
- Opial Z: Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 1967, 73: 591–597. 10.1090/S0002-9904-1967-11761-0View ArticleMathSciNetGoogle Scholar
- Goebel K, Kirk WA: Topics in Metric Fixed Point Theory. Cambridge University Press, Cambridge; 1990.View ArticleGoogle Scholar
- Tan KK, Xu HK: Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process. J. Math. Anal. Appl. 1993, 178: 301–308. 10.1006/jmaa.1993.1309View ArticleMathSciNetGoogle Scholar
- Berinde V Lecture Notes in Mathematics. In Iterative Approximation of Fixed Points. Springer, Berlin; 2007.Google Scholar
- Goebel K, Reich S: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings. Dekker, New York; 1984.Google Scholar
- Browder FE, Petryshyn WV: The solution by iteration of linear functional equations in Banach spaces. Bull. Am. Math. Soc. 1966, 72: 566–570. 10.1090/S0002-9904-1966-11543-4View ArticleMathSciNetGoogle Scholar
- Aoyama K, Kimura Y, Takahashi W, Toyoda M: On a strongly nonexpansive sequence in Hilbert spaces. J. Nonlinear Convex Anal. 2007, 8: 471–489.MathSciNetGoogle Scholar
- Baillon J-B, Haddad G: Quelques propriétés des opérateurs angle-bornés et n -cycliquement monotones. Isr. J. Math. 1977, 26: 137–150. 10.1007/BF03007664View ArticleMathSciNetGoogle Scholar
- Iiduka H: Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem. Nonlinear Anal. 2009, 71: 1292–1297. 10.1016/j.na.2009.01.133View ArticleMathSciNetGoogle Scholar
- Combettes PL, Bondon P: Hard-constrained inconsistent signal feasibility problems. IEEE Trans. Signal Process. 1999, 47: 2460–2468. 10.1109/78.782189View ArticleGoogle Scholar
- Browder FE: Convergence theorems for sequences of nonlinear operators in Banach spaces. Math. Z. 1967, 100: 201–225. 10.1007/BF01109805View ArticleMathSciNetGoogle Scholar
- Reich S, Shoikhet D: Nonlinear Semigroups, Fixed Points, and Geometry of Domains in Banach Spaces. Imperial College Press, London; 2005.View ArticleGoogle Scholar
- Iiduka H: Iterative algorithm for solving triple-hierarchical constrained optimization problem. J. Optim. Theory Appl. 2011, 148: 580–592. 10.1007/s10957-010-9769-zView ArticleMathSciNetGoogle Scholar
- Bauschke HH, Borwein JM: On projection algorithms for solving convex feasibility problems. SIAM Rev. 1996, 38: 367–426. 10.1137/S0036144593251710View ArticleMathSciNetGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.