一类广义变分不等式组的隐迭代算法

依赖于投影映射的性质,许多学者在Hilbert空间研究了具不同映射的变分不等式组解的逼近问题,但在Banach空间的研究比较少.其主要原因是因为在Banach空间投影映射缺乏很好的性质.本文利用向阳非扩张保核映射(the sunny nonexpansiveretraction mapping)Q_K的性质,导出了一种隐迭代方法.用这一方法,本文的结果把[M.A.Noor,K.I.Noor,Projection algorithms for solving a system of generalvariational inequalities,Nonlinear Analysis,70(2009)2700-2706]的主要成果从Hilbert空间推广到了Banach空间.     

无限维Hillbert空间中单调变分不等式解的近似迭代算法

在无穷维Hillbert空间中研究了一类单调型变分不等式，把求单调型变分不等式解的问题转化为求强单调变分不等式的解，建立了一种新的迭代算法，并证明了由算法生成的迭代序列强收敛于单调变分不等式的解，从而推广了所列文献中的许多重要结果．     

广义混合似变分不等式组的两步迭代算法

对H ilbert空间中一类广义混合似变分不等式组进行了研究;利用次微分算子的预解式技术,建立了广义混合似变分不等式组与不动点问题之间的等价关系;给出了一个求解这种广义混合似变分不等式组的显式两步迭代算法;并证明了该算法在适当的条件下收敛.     

求解单调变分不等式的两类迭代算法

给出了求解单调变分不等式的两类迭代算法．通过解强单调变分不等式子问题,产生两个迭代点列,都弱收敛到变分不等式的解．最后,给出了这两类新算法的收敛性分析．     

Hilbert空间中的广义非线性变分不等式组的投影算法

利用投影技术讨论了Hilbert空间中一类含松弛伪上强制映射的广义非线性变分不等式组的逼近解及其收敛性,所得到结果推广和统一了系列最新结果.     

一般混合似变分不等式的隐式迭代算法

对一般混合似变分不等式的若干隐式迭代算法进行了研究;利用一般混合似变分不等式与不动点问题和预解方程的等价关系,采用分裂技巧和自适应迭代技巧结合,提出了一个求解一般混合似变分不等式的新的隐式迭代算法;并证明了该算法在算子T是g-单调连续的条件下收敛．     

Hilbert空间上新的变分不等式问题和不动点问题的粘性迭代算法

本文在Hilbert空间上引入了一个新的粘性迭代算法,找到了关于两个逆强单调算子的变分不等式问题的解集与非扩张映射的不动点集的公共元.通过修改的超梯度算法,得到了强收敛定理,也给出了一个数值例子.所得结果改进了许多最新结果.     

一般伪单调变分不等式的改进投影算法

本文基于算子的分裂技巧给出了解一般伪单调变分不等式几种新的投影算法，包括三步和走步迭代算法．在算子T是g-伪单调和g-Lipschitz连续的条件下，即可证明新提出算法的收敛性．     

求解单调变分不等式问题的一类迭代方法

１．引言 变分不等式问题在数学规划中起着重要作用,它最初作为研究偏微分方程的工具,首先由 Ｆｉｓｈｅｒａ和 Ｓｔａｍｐａｃｃｈｉａ等于六十年代初提出,可参看［１］及其参考文献,之后也被广泛用于研究经济学和运筹学等领域中的均衡模型,互补问题和凸规划问题都是变分不等式问题的特殊情形,文献［２］对有限维变分不等式问题和非线性互补问题的理论、算法及应用作了十分全面的综述．设 Ｃ是实有限维空间 Ｒｎ,的非空闲凸子集, Ｆ是 Ｒｎ → Ｒｎ的映射,本文讨论的变分不等式问题ＶＩ（Ｃ,Ｆ）是： 求向量ｒ＊∈Ｃ．使得：Ｆ（…     

一类分裂变分不等式及其收敛算法

引入一种新的分裂变分不等式问题,构造了两种算法来求解,得到了相应迭代序列的弱收敛性和强收敛性.     

Iterative Methods for Triple Hierarchical Variational Inequalities in Hilbert Spaces

In this paper, we consider a variational inequality with a variational inequality constraint over a set of fixed points of a nonexpansive mapping called triple hierarchical variational inequality. We propose two iterative methods, one is implicit and another one is explicit, to compute the approximate solutions of our problem. We present an example of our problem. The convergence analysis of the sequences generated by the proposed methods is also studied.     

An Explicit Iterative Algorithm for a Class of Variational Inequalities in Hilbert Spaces

In this paper, we introduce a new explicit iterative algorithm for finding a solution for variational inequalities over the set of common fixed points of a finite family of nonexpansive maps on Hilbert spaces. An application and a numerical result are given for illustration.     

On Finite Convergence of Iterative Methods for Variational Inequalities in Hilbert Spaces

In a Hilbert space, we study the finite termination of iterative methods for solving a monotone variational inequality under a weak sharpness assumption. Most results to date require that the sequence generated by the method converges strongly to a solution. In this paper, we show that the proximal point algorithm for solving the variational inequality terminates at a solution in a finite number of iterations if the solution set is weakly sharp. Consequently, we derive finite convergence results for the gradient projection and extragradient methods. Our results show that the assumption of strong convergence of sequences can be removed in the Hilbert space case.     

A Simpler Explicit Iterative Algorithm for a Class of Variational Inequalities in Hilbert Spaces

In the present paper, we propose a simpler explicit iterative algorithm for finding a solution for variational inequalities over the set of common fixed points of a finite family of nonexpansive mappings on Hilbert spaces. A strong convergence theorem is proved under fewer restrictions imposed on the mappings and parameters. An extension and numerical result are also given to illustrate the effectiveness and superiority of the proposed algorithm.     

Hilbert空间中的广义松弛上强制变分不等式组

主要利用三步投影方法模型讨论了带误差估计的广义非线性上强制变分不等式组的逼近解及其收敛性,所得到结果推广和改进了一系列最新结果.     

Simultaneous Subgradient Algorithms for the Generalized Split Variational Inclusion Problem in Hilbert Spaces

In this article, we study the generalized split variational inclusion problem. For this purpose, motivated by the projected Landweber algorithm for the split equality problem, we first present a simultaneous subgradient extragradient algorithm and give related convergence theorems for the proposed algorithm. Next, motivated by the alternating CQ-algorithm for the split equality problem, we propose another simultaneous subgradient extragradient algorithm to study the general split variational inclusion problem. As applications, we consider the split equality problem, split feasibility problem, split variational inclusion problem, and variational inclusion problem in Hilbert spaces.     

Proximal Point Algorithms for General Variational Inequalities

This paper presents a unified framework of proximal point algorithms (PPAs) for solving general variational inequalities (GVIs). Some existing PPAs for classical variational inequalities, including both the exact and inexact versions, are extended to solving GVIs. Consequently, several new PPA-based algorithms are proposed. M. Li was supported by NSFC Grant 10571083 and SRFDP Grant 200802861031. L.Z. Liao was supported in part by grants from Hong Kong Baptist University and the Research Grant Council of Hong Kong. X.M. Yuan was supported in part by FRG/08-09/II-40 from Hong Kong Baptist University and NSFC Grant 10701055.