检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安交通大学
出 处:《工程数学学报》1990年第3期1-8,共8页Chinese Journal of Engineering Mathematics
摘 要:本文定义了求极大单调映象方程o∈Ax解的一个广义预解式迭代过程,并证明了所定义的迭代过程对该方程极小范数解的收敛性,所得结果改进并推广了R.T.Rockafcller[1],G.Kassay[8]等的基本收敛性定理。As an extension of R.T.Rockafcllar's proximal point algorithm for maximal monotone operators equation in Hilbert space, the authors propose a generalized resolvent iteration processes for the same problem in a reflexive Banach space X. It is proved that the generalized processes can be used to construct the minimum-norm solution of nonlinear operators equation 0∈Axwith A being an arbitrary maximal monotone mapping from X to X* .The convergence results obtained here provides not only a modification on Rockefellar's and G.assay's (Cf.[l], [8]), but also a partial answer to F.E.Browder's problem on constructively solvability for monotone mappings.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.141.33.133