解拟变分不等式的一种投影算法  

A Projection Method for Solving Quasi-variational Inequalities

作　　者：叶明露[1,2] 

机构地区：[1]四川师范大学数学与软件科学学院,成都610068 [2]西华师范大学数学与信息学院,南充637002

出　　处：《应用数学学报》2014年第1期160-169,共10页Acta Mathematicae Applicatae Sinica

基　　金：国家自然科学基金(11271274);西华师范大学科研启动基金(058003)资助项目

摘　　要：本文通过构造能严格分离当前迭代点与拟变分不等式解集的超平面,并且利用当前迭代点向所构造的超平面与可行集的交做投影来产生新的迭代点,从而给出了求解拟变分不等式的一种新的投影算法.在一定的假设条件下证明了该算法生成的无穷序列具有全局收敛性,数值试验表明该算法有较少的迭代步数.We present a new projection method for solving quasi-variational inequalities. This new method consists of following two steps： First, we construct a hyperplane which can separate strictly current iterate from the solution set of the quasi-variational inequalities. Second, the next iterate is generated by projecting the current iterate onto the intersection of the feasible set C and this hyperplane. Our method is proven to be globally convergent under certain assumptions. Nnumerical experiments show that our method have the less total number of iterative steps.

关 键 词：拟变分不等式 广义Nash均衡 超平面 投影方法 收敛 

分 类 号：O22[理学—运筹学与控制论] O177.92[理学—数学]