变分不等式问题(简称ⅥP)通过广义D—gap函数可以转化成无约束优化问题.在找到使优化问题目标函数达到最大的y值后,直接构造了一类下降方向,使算法避免了求解梯度问题.最后证明了这种算法具有全局收敛性.
Variational inequality problems (VIP) can be formulated as an unconstrained optimization problem via the generalized gap function. In this paper, we first obtain the y which maximizes the objection function of optimization problem, then construct a new desent direction. Thus, we avoid solving the gradient problem. Finally we show the global convergence of the algorithm.