General -monotone operators and perturbed iterations for nonlinear set-valued relaxed cocoercive operator inclusion problems

2009 ◽  
Vol 215 (4) ◽  
pp. 1583-1592 ◽  
Author(s):  
Heng-you Lan ◽  
Le-cai Cai ◽  
Zi-shan Liu
2020 ◽  
Vol 10 (1) ◽  
pp. 450-476
Author(s):  
Radu Ioan Boţ ◽  
Sorin-Mihai Grad ◽  
Dennis Meier ◽  
Mathias Staudigl

Abstract In this work we investigate dynamical systems designed to approach the solution sets of inclusion problems involving the sum of two maximally monotone operators. Our aim is to design methods which guarantee strong convergence of trajectories towards the minimum norm solution of the underlying monotone inclusion problem. To that end, we investigate in detail the asymptotic behavior of dynamical systems perturbed by a Tikhonov regularization where either the maximally monotone operators themselves, or the vector field of the dynamical system is regularized. In both cases we prove strong convergence of the trajectories towards minimum norm solutions to an underlying monotone inclusion problem, and we illustrate numerically qualitative differences between these two complementary regularization strategies. The so-constructed dynamical systems are either of Krasnoselskiĭ-Mann, of forward-backward type or of forward-backward-forward type, and with the help of injected regularization we demonstrate seminal results on the strong convergence of Hilbert space valued evolutions designed to solve monotone inclusion and equilibrium problems.


2018 ◽  
Vol 51 (1) ◽  
pp. 241-254
Author(s):  
Jong Kyu Kim ◽  
Muhammad Iqbal Bhat

AbstractIn this paper, we introduce and study a new system of variational inclusions which is called a system of nonlinear implicit variational inclusion problems with A-monotone and H-monotone operators in semi-inner product spaces. We define the resolvent operator associated with A-monotone and H-monotone operators and prove its Lipschitz continuity. Using resolvent operator technique, we prove the existence and uniqueness of solution for this new system of variational inclusions. Moreover, we suggest an iterative algorithm for approximating the solution of this system and discuss the convergence analysis of the sequences generated by the iterative algorithm under some suitable conditions.


2011 ◽  
Vol 2011 ◽  
pp. 1-15 ◽  
Author(s):  
Lingling Huang ◽  
Sanyang Liu ◽  
Weifeng Gao

This paper presents and analyzes a strongly convergent approximate proximal point algorithm for finding zeros of maximal monotone operators in Hilbert spaces. The proposed method combines the proximal subproblem with a more general correction step which takes advantage of more information on the existing iterations. As applications, convex programming problems and generalized variational inequalities are considered. Some preliminary computational results are reported.


2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Huan-chun Wu ◽  
Cao-zong Cheng

We introduce a new iterative method for finding a common element of the set of solutions of an equilibrium problem and the set of zeros of the sum of maximal monotone operators, and we obtain strong convergence theorems in Hilbert spaces. We also apply our results to the variational inequality and convex minimization problems. Our results extend and improve the recent result of Takahashi et al. (2012).


2012 ◽  
Vol 2012 ◽  
pp. 1-21
Author(s):  
Jittiporn Suwannawit ◽  
Narin Petrot

We introduce and study a class of a system of random set-valued variational inclusion problems. Some conditions for the existence of solutions of such problems are provided, when the operators are contained in the classes of generalized monotone operators, so-called (A,m,η)-monotone operator. Further, the stability of the iterative algorithm for finding a solution of the considered problem is also discussed.


Filomat ◽  
2017 ◽  
Vol 31 (19) ◽  
pp. 6051-6070
Author(s):  
Mohd Bhat ◽  
Bisma Zahoor

In this paper, we consider the system of generalized variational-like inclusion problems in semi-inner product spaces. We define a class of (H,?)-?-monotone operators and its associated class of generalized resolvent operators. Further, using generalized resolvent operator technique, we give the existence of solution of the generalized variational-like inclusion problems. Furthermore, we suggest an iterative algorithm and give the convergence analysis of the sequences generated by the iterative algorithm. The results presented in this paper extend and unify the related known results in the literature.


Author(s):  
Mujahid Abbas ◽  
Faik Gürsoy ◽  
Yusuf Ibrahim ◽  
Abdul Rahim Khan

We introduce a new algorithm to approximate a solution of split variational inclusion problems of multivalued maximal monotone operators in uniformly convex and uniformly smooth Banach spaces under the Bregman distance. A strong convergence theorem for the above problem is established and several important known results are deduced as corollaries to it. As application, we solve a split minimization problem and provide a numerical example to support better findings of our result.


2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Heng-you Lan

We introduce and study a new notion of relativelyA-maximalm-relaxed monotonicity framework and discuss some properties of a new class of generalized relatively resolvent operator associated with the relativelyA-maximalm-relaxed monotone operator and the new generalized Yosida approximations based on relativelyA-maximalm-relaxed monotonicity framework. Furthermore, we give some remarks to show that the theory of the new generalized relatively resolvent operator and Yosida approximations associated with relativelyA-maximalm-relaxed monotone operators generalizes most of the existing notions on (relatively) maximal monotone mappings in Hilbert as well as Banach space and can be applied to study variational inclusion problems and first-order evolution equations as well as evolution inclusions.


Author(s):  
Minh N. Dao ◽  
Hung M. Phan

AbstractSplitting algorithms for finding a zero of sum of operators often involve multiple steps which are referred to as forward or backward steps. Forward steps are the explicit use of the operators and backward steps involve the operators implicitly via their resolvents. In this paper, we study an adaptive splitting algorithm for finding a zero of the sum of three operators. We assume that two of the operators are generalized monotone and their resolvents are computable, while the other operator is cocoercive but its resolvent is missing or costly to compute. Our splitting algorithm adapts new parameters to the generalized monotonicity of the operators and, at the same time, combines appropriate forward and backward steps to guarantee convergence to a solution of the problem.


Sign in / Sign up

Export Citation Format

Share Document