Academic Editor: Yeol J. Cho
Copyright © 2011 Yonghong Yao et al. This is an open access article distributed under the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
We devote this paper to solving the variational inequality of finding with property such that for all . Note that this hierarchical problem is associated with some convex programming problems. For solving the above VI, we suggest two algorithms: Implicit Algorithmml: for all and Explicit Algorithm: for all . It is shown that these two algorithms converge strongly to the unique solution of the
above VI. As special cases, we prove that the proposed algorithms strongly converge to
the minimum norm fixed point of .