一类Curvature方程组解的迭代逼近

本文给出一类Curvature方程组解的构造,并建立其解与有限个极大单调算子公共零点之间的关系.借助于极大单调算子的广义豫解式,设计新的投影迭代算法,利用Lyapunov泛函、广义投影映射和保核收缩映射等工具,证明迭代序列在Banach空间中强收敛到有限个极大单调算子公共零点的结论.进而得到Curvature方程组解的迭代逼近序列.推广和补充了以往的相关研究成果.     

Banach空间中极大单调算子零点的带误差项的新迭代格式

令E为实光滑、一致凸Banach空间,E为其对偶空间,AE×E为极大单调算子且A-10≠Φ.本文将引入新的迭代算法,并利用Lyapunov泛函,Qr算子与广义投影算子等技巧,证明了迭代序列弱收敛于极大单调算子A的零点的结论.     

Banach空间中极大单调算子零点的迭代逼近定理

令E为实光滑、一致凸Banach空间,E为其对偶空间．令A■ E x E为极大单调算子, A-10≠■．本文将引入新的迭代算法,并利用Lyapunov泛函, Qr算子与广义投影算子等技巧,证明了迭代序列弱收敛于极大单调算子A的零点的结论．     

Banach空间中有限个极大单调算子公共零点的投影算法

设计了一种带误差项的新投影迭代算法,利用Lyapunov泛函与广义投影映射等技巧,在Banach空间中,证明了迭代序列强收敛于有限个极大单调算子公共零点的结论.     

Banach空间中极大单调算子零点的迭代构造

设E为实光滑、一致凸Banach空间,E*为其对偶空间,TE×E*为极大单调算子且T-10≠φ.本文引入了一种新迭代格式,利用Lyapunov泛函和广义投影算子等技巧,在Banach空间中证明了迭代序列弱收敛于极大单调算子T的零点的结论.     

Banach空间中两个极大单调算子公共零点的迭代格式

令E为实光滑、一致凸Banach空间,E~*为其对偶空间.令A,B(?)E×E~*为极大单调算子且A~(-1)∩B~(-1)0≠(?).本文将引入新的迭代格式,利用Lyapunov泛函与广义投影算子等技巧,证明迭代序列弱收敛于极大单调算子A和B的公共零点.     

一类p-Laplacian型Neumann边值问题非平凡解的存在性及迭代算法研究

首先将一类p-Laplacian型Neumann边值问题转化为含有极大单调算子的算子方程的形式,得到算子方程解的存在性结论,进而证明p-Laplacian型Neumann边值问题有非平凡解;其次,借助于极大单调算子的相对预解式构造出强收敛到极大单调算子零点的迭代序列;最后,建立p-Laplacian型Neumann边值问题的解与极大单调算子零点的关系,得到解的迭代逼近序列.推广和补充了以往的相关研究成果.     

有限个极大单调算子公共零点的迭代逼近

令E为实光滑、一致凸Banach空间,E~*为其对偶空间.令A_i  E×E~*,i= 1,2,…,m为极大单调算子且∩_(i=1)~m A_i~(-1) 0≠φ.引入了一种新的迭代算法,利用Lyapunov泛函与广义投影算子等技巧,证明迭代序列弱收敛于极大单调算子A_i,i=1,2,…,m的公共零点.     

Banach空间中有限个极大单调算子公共零点的迭代格式

令E为实光滑、一致凸Banach空间,E~*为其对偶空间．令A_i,B_i (?) E×E~*,i= 1,2,…,m,为极大单调算子且(?)(A_i~(-1)0∩B_i~(-1)0)≠φ．引入新的迭代算法,并利用Lyapunov泛函,Q_r算子与广义投影算子等技巧,证明迭代序列弱收敛于极大单调算子A_i,B_i,i= 1,2,…,m的公共零点的结论．     

Banach空间中均衡问题和弱相对非扩展映射的强收敛定理及其应用(英文)

本文在Banach空间中设计了一些新的杂交迭代算法用以逼近一类均衡问题解集和弱相对非扩展映射不动点集或极大单调算子零点集的公共元.得到了一些强收敛的结论,并将它们推广到逼近一类均衡问题解集和有限个弱相对非扩展映射公共不动点集或有限个极大单调算子公共零点集的公共元的情形.最后,展示了本文的迭代算法在最优化问题上的应用.     

Banach空间有限个极大单调算子公共零点的迭代注记

令E为实光滑、一致凸Banach空间,E*为其对偶空间.令AiE×E*,i=1,2,…,m,为极大单调算子且∩mi=1Ai-10≠φ.将给出一种计算量较小的新迭代算法,并利用Lyapunov泛函与广义投影算子等技巧,证明迭代序列弱收敛于A的公共零点,i=1,2,…,m.     

Banach空间有限个极大单调算子公共零点的迭代强收敛定理

令E为实光滑、一致凸Banach空间,E为其对偶空间.令Ai E×E,i=1,2,…,m,为极大单调算子且∩mi=1Ai-10≠.将引进一个新定义、给出一种新迭代算法,并利用Lyapunov泛函与广义投影算子等技巧,证明迭代序列强收敛于Ai的公共零点,i=1,2,…,m.去掉了以往结论中过强的限定条件,是对笔者以往工作的延续。     

Split common fixed point and common null point problem

In this paper, we present a new algorithm for solving the split common null point and common fixed point problem, to find a point that belongs to the common element of common zero points of an infinite family of maximal monotone operators and common fixed points of an infinite family of demicontractive mappings such that its image under a linear transformation belongs to the common zero points of another infinite family of maximal monotone operators and its image under another linear transformation belongs to the common fixed point of another infinite family of demicontractive mappings in the image space. We establish strong convergence for the algorithm to find a unique solution of the variational inequality, which is the optimality condition for the minimization problem. As special cases, we shall use our results to study the split equilibrium problems and the split optimization problems.     

Metric subregularity and the proximal point method

We examine the linear convergence rates of variants of the proximal point method for finding zeros of maximal monotone operators. We begin by showing how metric subregularity is sufficient for local linear convergence to a zero of a maximal monotone operator. This result is then generalized to obtain convergence rates for the problem of finding a common zero of multiple monotone operators by considering randomized and averaged proximal methods.     

Visco-penalization of the sum of two monotone operators

A new type of approximating curve for finding a particular zero of the sum of two maximal monotone operators in a Hilbert space is investigated. This curve consists of the zeros of perturbed problems in which one operator is replaced with its Yosida approximation and a viscosity term is added. As the perturbation vanishes, the curve is shown to converge to the zero of the sum that solves a particular strictly monotone variational inequality. As an off-spring of this result, we obtain an approximating curve for finding a particular zero of the sum of several maximal monotone operators. Applications to convex optimization are discussed.     

Iterative convergence theorems for maximal monotone operators and relatively nonexpansive mappings

In this paper, some iterative schemes for approximating the common element of the set of zero points of maximal monotone operators and the set of fixed points of relatively nonexpansive mappings in a real uniformly smooth and uniformly convex Banach space are proposed. Some strong convergence theorems are obtained, to extend the previous work.