节点文献

拟变分不等式问题的算法研究

On Algorithms for Quasi-variational Inequality Problem

【作者】 桓莉莉

【导师】 屈彪;

【作者基本信息】 曲阜师范大学 , 运筹学与控制论, 2010, 硕士

【摘要】 本文主要研究拟变分不等式问题的算法.针对这类问题,我们给出了三种算法并对其进行了研究.全文共分为四章.第一章是绪论,主要介绍了拟变分不等式问题的研究现状以及本文的主要研究工作.第二章主要在文献[25]第三部分的基础上对其提出的求解拟变分不等式问题的投影算法做了进一步的研究,并且在一些合适的前提条件下,给出了该投影算法Q-线性收敛速度的证明.第三章利用广义正则gap函数的方向导数,构造了一种迭代方向,提出了一类求解拟变分不等式问题的算法.此算法不需关心目标函数的梯度计算问题,与相关文献比较,该算法的适用范围更加广泛.在某些假设条件下,证明了算法的收敛性.第四章在文献[26]的基础上,构造了一种严格下降方向,提出了求解拟变分不等式问题的另一类下降算法.在理论上,此算法避免了涉及最优化问题的目标函数的梯度问题.与第三章相比较,本章中的假设条件由正定减弱为半正定.同时在一些合理的假设下,保证了该算法的有效性和收敛性.

【Abstract】 In this dissertation, we mainly investigate the algorithms for quasi-variational inequality problem. We design three methods for solving quasi-variational in-equality problem. Four chapters are included in this thesis.Chapter 1 is the introduction. We describe the research situations of quasi-variational inequality problem. The main contributions of this paper are also stated briefly.In Chapter 2, based on the third section of [25], we do further research on the projection method for quasi-variational inequality problem. Under some appropriate conditions, we prove the Q-linear convergence rate of the related projection method.In Chapter 3, constructing a descent direction obtained from the direc-tional differentiability of the (generalized) regularized gap function, we present a derivative-free descent method for solving the quasi-variational inequality prob-lem. We do not need consider the gradient problem of the objective function. Compared with the ones in the related references, the method of this paper has the superiority that the application is more wider. Under some reasonable con-ditions, the convergence of the algorithm is proved.In Chapter 4, by constructing a strictly descent direction in the spirit of [26], we present another descent algorithm for solving the quasi-variational in-equality problem. We still do not need consider the gradient problem of the objective function. Compared with Chapter 3, the assumption that the▽F(·) is semi-positive definite is weaker than the one that▽F(·) is positive-definite. In addition, the effectiveness and convergence of this algorithm is guaranteed under some reasonable conditions.

节点文献中: 

本文链接的文献网络图示:

本文的引文网络