Skip to main content

Algorithms Construction for Variational Inequalities

Abstract

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

Affiliations

Authors

Corresponding author

Correspondence to Shin Min Kang.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Yao, Y., Liou, Y. & Kang, S.M. Algorithms Construction for Variational Inequalities. Fixed Point Theory Appl 2011, 794203 (2011). https://doi.org/10.1155/2011/794203

Download citation

Keywords

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