Skip to main content

Algorithms Construction for Variational Inequalities


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 .

Publisher note

To access the full article, please see PDF.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Shin Min Kang.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Yao, Y., Liou, YC. & Kang, S.M. Algorithms Construction for Variational Inequalities. Fixed Point Theory Appl 2011, 794203 (2011).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI:


  • Variational Inequality
  • Differential Geometry
  • Computational Biology
  • Full Article
  • Algorithm Construction