Weakly sharp solutions and finite convergence of algorithms for a variational inequality problem

Yina Liu*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


The aim of the paper is to characterize weakly sharp solutions of a variational inequality problem. In particular, we present weak sharpness results by using primal and dual gap functions, g and G, and also without considering gap functions, either. The subdifferential and locally Lipschitz properties of g + λG for λ > 0 are first studied since they are useful for discussing weakly sharp solutions of the variational inequality. A result of finite termination of a class of algorithms for solving the variational inequality problem is also studied.

Original languageEnglish
Pages (from-to)329-340
Number of pages12
Issue number2
Publication statusPublished - 1 Feb 2018


  • Variational inequality
  • convergence of an algorithm
  • error bound
  • gap functions
  • gâteaux differentiable
  • locally Lipschitz property
  • weakly sharp solution

Cite this