首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
在H illbert空间和Banach空间中,通过隐粘性迭代方法和显粘性逼近方法,证明了非扩张半群公共不动点的强收敛定理.所得结论改进和扩展了近期的相关结果.  相似文献   

2.
唐艳 《数学杂志》2013,33(1):99-104
本文研究了非扩张映射不动点的逼近问题的迭代方法.利用粘性逼近方法,在具有一致Gateaux可微范数的Banach空间中,获得了迭代序列的强收敛性,并说明了该序列强收敛于某变分不等式的唯一解.该方法推广了某些文献的结果.  相似文献   

3.
在具有一致Gateaux可微范数的Banach空间中,讨论了一个逼近渐近非扩张强连续半群不动点的两步粘性逼近方法,并在一定条件下证明了该方法所得到的迭代序列的强收敛性.  相似文献   

4.
在具有一致Gateaux可微范数的Banach空间中,建立了一个改进的非扩张映射不动点的粘性逼近方法,并在一定条件下证明了该方法所得到的迭代序列的强收性.本文所得结果扩展并统一了部分文献的结果.  相似文献   

5.
该文在Hilbert空间中,利用CQ方法证明了修正渐近非扩张半群的Ishikawa迭代序列的强收敛性,此结果推广并改进了一些相关结论.  相似文献   

6.
分层不动点及变分不等式的粘性方法及应用   总被引:1,自引:0,他引:1       下载免费PDF全文
介绍了处理变分不等式问题的一种分层不动点的粘性方法.这一方法所涉及的映像是非扩张的,而其解是从另一非扩张映像的不动点集中求出.在文末,还把这一结果应用于研究单调变分不等式问题、凸规划问题、分层极小化问题及在不动点集上的二次极小化问题.  相似文献   

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

8.
目的是利用全渐近非扩张映象研究分层不动点和变分不等式公共不动点的迭代算法.在适当条件下,某些强收敛定理被证明.结果改进和推广了Yao Y H(2010)和ZHANG S S等人(2011)的最新结果.  相似文献   

9.
该文提出了关于含松弛强制映像变分不等式和不动点问题解的一个投影迭代算法,所得结果改进和推广了目前一些作者的研究结果.  相似文献   

10.
该文在Hilbert空间中提出一种新Tseng型外梯度算法,用以求解一致连续伪单调映射的变分不等式问题与具有半封闭性拟非扩张映射的不动点问题的公共解.在一定的假设条件下,证明了算法所生成的序列的强收敛性.文章最后对算法进行数值实验,验证了算法的有效性.  相似文献   

11.
In this paper, a convex feasibility problem is considered. We construct an iterative method to approximate a common element of the solution set of classical variational inequalities and of the fixed point set of a strict pseudocontraction. Strong convergence theorems for the common element are established in the framework of Hilbert spaces.  相似文献   

12.
一类求解单调变分不等式的隐式方法   总被引:6,自引:0,他引:6  
何炳生 《计算数学》1998,20(4):337-344
1.引言变分不等式是一个非常有趣。非常困难的数学问题["].它具有广泛的应用(例如,数学规划中的许多基本问题都可以归结为一个变分不等式问题),因而得到深入的研究并有了不少算法[1,2,5-8,17-21].对线性单调变分不等式,我们最近提出了一系列投影收缩算法Ig-13].本文考虑求解单调变分不等式其中0CW是一闭凸集,F是从正p到自身的一个单调算子,一即有我们用比(·)表示到0上的投影.求解单调变分不等式的一个简单方法是基本投影法[1,6],它的迭代式为然而,如果F不是仿射函数,只有当F一致强单调且LIPSChitZ连续…  相似文献   

13.
In this paper we study the proximal point algorithm (PPA) based prediction-correction (PC) methods for monotone variational inequalities. Each iteration of these methods consists of a prediction and a correction. The predictors are produced by inexact PPA steps. The new iterates are then updated by a correction using the PPA formula. We present two profit functions which serve two purposes: First we show that the profit functions are tight lower bounds of the improvements obtained in each iteration. Based on this conclusion we obtain the convergence inexactness restrictions for the prediction step. Second we show that the profit functions are quadratically dependent upon the step lengths, thus the optimal step lengths are obtained in the correction step. In the last part of the paper we compare the strengths of different methods based on their inexactness restrictions.  相似文献   

14.
In this paper, strong convergence of an iterative sequence is proved, which computes an approximate solution of the set of solutions of split variational inclusion problem, the set of fixed points of a nonexpansive mapping and the set of common fixed points of a family of generalized asymptotically nonexpansive semigroup. Results obtained in this paper extend and unify the previously known results in the previous literatures.  相似文献   

15.
The monotone variational inequalities Ⅵ(Ω,F)have vast applications, including opti-mal controls and convex programming.In this paper we focus on the Ⅵ problems thathave a particular splitting structure and in which the mapping F does not have an explicitform,therefore only its function values can be employed in the numerical methods for solv-ing such problems.We study a set of numerical methods that are easily implementable.Each iteration of the proposed methods consists of two procedures.The first(prediction)procedure utilizes alternating projections to produce a predictor.The second(correction)procedure generates the new iterate via some minor computations.Convergence of theproposed methods is proved under mild conditions.Preliminary numerical experiments forsome traffic equilibrium problems illustrate the effectiveness of the proposed methods.  相似文献   

16.
The boundary element approximation of the parabolic variational inequalities of the second kind is discussed. First, the parabolic variational inequalities of the second kind can be reduced to an elliptic variational inequality by using semidiscretization and implicit method in time; then the existence and uniqueness for the solution of nonlinear non-differentiable mixed variational inequality is discussed. Its corresponding mixed boundary variational inequality and the existence and uniqueness of its solution are yielded. This provides the theoretical basis for using boundary element method to solve the mixed vuriational inequality.  相似文献   

17.
提出了一个简单的非扩张映像不动点的逼近算法,该算法通过非迭代的逼近序列来实现.从算法的复杂性来看,提出的算法比经典的Mann迭代算法、Ishikawa迭代算法和Halpern迭代算法更简单.提出的算法紧密联系着非扩张映像不动点的存在性,因此,还得到了非扩张映像的新不动点定理, 拓展和改进了经典的Goebel-Kirk,Kim-Xu等作者的结果.  相似文献   

18.
In this paper, a successive approximation Broyden-like method is presented for the box constrained variational inequality problems based on its equivalent nonsmooth equations. The global convergence of the algorithm is obtained under suitable conditions. Numerical results are also reported.  相似文献   

19.
1.IntroductionLetMbeannxnmatrixandletqbeavectorinR",then-dimensionalEnclideanspace.Letfibeannonemptyclosedconvexset.Thelinearvariationalinequalityproblem(denotedby(LVI))istofindx*Efisuchthat(x~x*)"(MX* q)20,VxEfi.(1.1)Theproblem(1.1)iswellknowninoptimizationandcontainsasspecialcajseslinear(andquadratic)programming,bimatrixgame,etc.(seeCottleandDantzigti]).Whenfiisapolyhedralset,forconvenienceexpressedasX~{xER"IAx2b},AERm"",bERe,(1.2)itiscalledtheaffinevariationalinequalityproblem(AV…  相似文献   

20.
一类拟双线性型变分不等式解的存在性   总被引:6,自引:1,他引:6  
本文引入和讨论了一类拟双线性型变分不等式解的存在性问题,其结果改进了文[4-6]中的相应结果.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号