Banach空间中的隐式集值变分包含的一种扰动算法

在Banach空间中研究了一类新的变分包含——隐式集值变分包含问题，得到了隐式变分包含解的等价性与存在性命题及其解的扰动算法，推广、改进了国内外近期获得的一些结果．     

集值非线性混合变分包含问题的一类新的迭代算法

在Hilbert空间中讨论一类广义集值非线性混合变分包含问题近似解的存在性，建立变分包含与广义预解方程的等价性，形成了迭代算法并研究了算法的收敛性．     

对带误差项的Banach空间中完全广义集值拟变分包含的摄动迭代算法

研究了一类新的实Banach空间中的广义集值拟变分包含:f∈N(x，y) M(z，v) W(g(u)-h(w)，u)，它包含了近几年许多作者所作的变分包含同题．在买Banach空间中，利用极大增生算子的性质，建立了Banach空间中的广义集值拟变分包含和不动点问题间的等价性．利用这种等价性，建立了一些摄动迭代算法，并证明了近似解序列强收敛于精确解．本文的算法和结果改进和一般化了最近许多文章中相应的算法和结果。     

Banach空间中的广义Hη增生算子及其在变分包含中的应用

在Banach空间中,引入和研究了新的广义H-η-增生算子,对广义m-增生算子与H-η-单调算子提供了一个统一的框架．还定义了广义H-η-增生算子相应的预解算子,并且证明了其Lipschitz连续性．作为应用,考虑了涉及广义H-η-增生算子的一类变分包含问题的可解性．利用预解算子方法,构造了一个求解变分包含的迭代算法．在适当假设下,证明了变分包含解的存在性和由算法生成的迭代序列的收敛性．     

对带误差项的广义集值变分包含的近似点算法

研究一类新的广义集值变分包含：０∈Ｎ（ｗ,ｙ）＋Ａ（ｚ,ｕ）,它包合了近几年许多作者所作的变分包合问题．在实Ｈｉｌｂｅｒｔ空间中,利用极大单调算子的性质,建立了广义集值变分包合和不动点问题间的等价性．利用这种等价性,建立了一些摄动迭代算法,并证明了近似解序列强收敛于精确解．本文的算法和结果改进和一般化了最近许多文章中相应的算法和结果．     

一类新的广义集值变分包含问题解的辅助序列迭代算法

本文提出并研究了Banach空间中的一类新的广义集值变分包含问题：0∈N（ω，y）＋A（z，v），由集值m-增生映射的预解算子建立了广义集值变分包含与不动点问题的等价性，并利用Nadler定理和辅助序列建立了一些迭代算法，证明了解的存在性和算法的全局收敛性．     

关于fuzzy映射的完全广义混合强非线性变分包含

引入并研究了Hilbert空间中一类新的关于fuzzy映射的完全广义混合强非线性变分包含，利用极大单调映射的预解算子技巧构造迭代算法．并证明此变分包含的解的存在性及由迭代算法所生成的迭代序列的收敛性。所得结果改进并推广以往所得的相应结果。     

Banach空间中无限族广义集值拟变分包含

推广了Banach空间中广义拟变分包含的概念，研究了无限族广义集值拟变分包含的解的存在性及其迭代逼近问题．所得结果改进和推广了一些最新的成果．     

一类拟变分包含问题带误差的迭代算法

本文研究了一类带误差的拟变分包含问题的迭代算法.利用黏性逼近法,获得了拟变分包含问题的迭代算法的强收敛结果,将最近一些文献的相应结果从迭代算法推广到带误差的迭代算法.     

一类广义非线性混合拟变分包含组

本文引入了一类新的带松弛单调映射和松弛Lipschitz映射的广义非线性混合拟变分包含组 ,构造了求解该类变分包含组的迭代算法 ,证明了该类变分包含组解的存在性以及由本文构造的迭代算法产生的迭代序列的强收敛性 .所得结果推广和改进了大量文献中的最新结果[1 5 ] .     

Accelerated projection-based forward-backward splitting algorithms for monotone inclusion problems

In this paper, based on inertial and Tseng''s ideas, we propose two projection-based algorithms to solve a monotone inclusion problem in infinite dimensional Hilbert spaces. Solution theorems of strong convergence are obtained under the certain conditions. Some numerical experiments are presented to illustrate that our algorithms are efficient than the existing results.     

Algorithms with new parameter conditions for split variational inclusion problems in Hilbert spaces with application to split feasibility problem

Split variational inclusion problem is an important problem, and it is a generalization of the split feasibility problem. In this paper, we present feasible algorithms for the split variational inclusion problems in Hilbert spaces, and provide convergence theorems for these algorithms. As application, we study the split feasibility problem in real Hilbert spaces. Final, numerical results are given for our main results.     

Halpern- and Mann-Type Algorithms for Fixed Points and Inclusion Problems on Hadamard Manifolds

In this article, we consider an inclusion problem which is defined by means of a sum of a single-valued vector field and a set-valued vector field defined on a Hadamard manifold. We propose Halpern-type and Mann-type algorithms for finding a common point of the set of fixed points of a nonexpansive mapping and the set of solutions of the inclusion problem defined on a Hadamard manifold. Some particular cases of our problem and algorithm are also discussed. We study the convergence of the proposed algorithm to a common point of the set of fixed points of a nonexpansive mapping and the set of solutions of the inclusion problem defined on a Hadamard manifold. As applications of our results and algorithms, we derive the solution methods and their convergence results for the optimization problems, variational inequality problems and equilibrium problems in the setting of Hadamard manifolds.     

Convergence analysis of a general iterative algorithm for finding a common solution of split variational inclusion and optimization problems

The purpose of this paper is to introduce a general iterative method for finding a common element of the set of common fixed points of an infinite family of nonexpansive mappings and the set of split variational inclusion problem in the framework Hilbert spaces. Strong convergence theorem of the sequences generated by the purpose iterative scheme is obtained. In the last section, we present some computational examples to illustrate the assumptions of the proposed algorithms.     

Hybrid inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces with applications

In this paper, we present hybrid inertial proximal algorithms for the split variational inclusion problems in Hilbert spaces, and provide convergence theorems for the proposed algorithms. In fact, an inertial type algorithm was proposed as an acceleration process. As application, we study split minimization problem, split feasibility problem, relaxed split feasibility problem and linear inverse problem in real Hilbert spaces. Finally, numerical results are given for our main results.     

On the Relationship Between Solutions of Stochastic and Random Differential Inclusions

Some results on the relationship of the solutions of a stochastic differential inclusion and the corresponding random differential inclusion obtained after a change of variable are proved. As a consequence, we obtain the pullback convergence of the solutions of the stochastic inclusion to a compact random set. The cases of a reaction–diffusion inclusion perturbed by additive and multiplicative noises are considered.     

New algorithms for the split variational inclusion problems and application to split feasibility problems

ABSTRACT

In this paper, we suggest two new iterative methods for finding an element of the solution set of split variational inclusion problem in real Hilbert spaces. Under suitable conditions, we present weak and strong convergence theorems for these methods. We also apply the proposed algorithms to study the split feasibility problem. Finally, we give some numerical results which show that our proposed algorithms are efficient and implementable from the numerical point of view.     

Convergence of Inexact Mann Iterations Generated by Nearly Nonexpansive Sequences and Applications

The Mann iterates behave well for nonexpansive mappings for any initial guess in the domain. Our aim in this article is to extend this method to a broad class of inexact fixed point algorithms generated by nearly nonexpansive sequences in Banach spaces and to locate the weak limit of the iterates by its initial guesses. Due to the inexactness, our algorithms become e?ciently applicable for a wider class of problems. As applications, we give convergence theorems for finding solutions of variational inclusion problems and constrained multiple-sets split feasibility problems. Our results are significant refinements and improvements of the corresponding results in the literature.