• Bulletin of the Korean Mathematical Society
• /
• v.47 no.2
• /
• pp.263-274
• /
• 2010

In this paper, a new class of general nonlinear variational inclusions involving H-monotone is introduced and studied in Hilbert spaces. By applying the resolvent operator associated with H-monotone, we prove the existence and uniqueness theorems of solution for the general nonlinear variational inclusion, construct an iterative algorithm for computing approximation solution of the general nonlinear variational inclusion and discuss the convergence of the iterative sequence generated by the algorithm. The results presented in this paper improve and extend many known results in recent literatures.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.2
• /
• pp.241-256
• /
• 2004

In this paper, we introduce and study a new class of variational inclusions, called the general variational inclusion. We prove the equivalence between the general variational inclusions, the general resolvent equations, and the fixed-point problems, using the resolvent operator technique. This equivalence is used to suggest and analyze a few iterative algorithms for solving the general variational inclusions and the general resolvent equations. Under certain conditions, the convergence analyses are also studied. The results presented in this paper generalize, improve and unify a number of recent results.

• East Asian mathematical journal
• /
• v.26 no.1
• /
• pp.95-103
• /
• 2010

In this paper using Lipschitz continuity of the resolvent operator associated with general H-maximal m-relaxed $\eta$-monotone operators, existence and uniqueness of the solution of a variational inclusion system is proved. Also, an iterative algorithm and its convergence analysis is given.

• East Asian mathematical journal
• /
• v.26 no.1
• /
• pp.59-67
• /
• 2010

In this paper, we suggest and analyze some three step iterative scheme for finding the common elements of the set of the solutions of the extended general variational inequalities involving three operators and the set of the fixed points of nonexpansive mappings. We also consider the convergence analysis of suggested iterative schemes under some mild conditions. Since the extended general variational inequalities include general variational inequalities and several other classes of variational inequalities as special cases, results obtained in this paper continue to hold for these problems. Results obtained in this paper may be viewed as a refinement and improvement of the previously known results.

• Communications of the Korean Mathematical Society
• /
• v.26 no.4
• /
• pp.685-693
• /
• 2011

General framework for proximal point algorithms based on the notion of (A, ${\eta}$)-maximal monotonicity (also referred to as (A, ${\eta}$)-monotonicity in literature) is developed. Linear convergence analysis for this class of algorithms to the context of solving a general class of nonlinear variational inclusion problems is successfully achieved along with some results on the generalized resolvent corresponding to (A, ${\eta}$)-monotonicity. The obtained results generalize and unify a wide range of investigations readily available in literature.

• Korean Journal of Mathematics
• /
• v.24 no.2
• /
• pp.199-213
• /
• 2016

The resolvent operator approach of [2] is applied to solve a set-valued variational inclusion problem in ordered Hilbert spaces. The resolvent operator under consideration is called relaxed resolvent operator and we demonstrate some of its properties. To obtain the solution of a set-valued variational inclusion problem, an iterative algorithm is developed and weak-RRD set-valued mapping is used. The problem as well as main result of this paper are more general than many previous problems and results available in the literature.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.1
• /
• pp.175-203
• /
• 2023

In this paper, we study an iterative algorithm that is based on inertial proximal and contraction methods embellished with relaxation technique, for finding common solution of monotone variational inclusion, and fixed point problems of pseudocontractive mapping in real Hilbert spaces. We establish a strong convergence result of the proposed iterative method based on prediction stepsize conditions, and under some standard assumptions on the algorithm parameters. Finally, some special cases of general problem are given as applications. Our results improve and generalized some well-known and related results in literature.

• East Asian mathematical journal
• /
• v.27 no.5
• /
• pp.545-555
• /
• 2011

Based on the A-maximal(m)-relaxed monotonicity frameworks, the approximation solvability of a general class of variational inclusion problems using the relaxed proximal point algorithm is explored, while generalizing most of the investigations, especially of Xu (2002) on strong convergence of modified version of the relaxed proximal point algorithm, Eckstein and Bertsekas (1992) on weak convergence using the relaxed proximal point algorithm to the context of the Douglas-Rachford splitting method, and Rockafellar (1976) on weak as well as strong convergence results on proximal point algorithms in real Hilbert space settings. Furthermore, the main result has been applied to the context of the H-maximal monotonicity frameworks for solving a general class of variational inclusion problems. It seems the obtained results can be used to generalize the Yosida approximation that, in turn, can be applied to first- order evolution inclusions, and can also be applied to Douglas-Rachford splitting methods for finding the zero of the sum of two A-maximal (m)-relaxed monotone mappings.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.603-619
• /
• 2011

To the best of our knowledge, it would probably be the first time in the literature that we clarify the relationship between Yamada's method and viscosity iteration correctly. We design iterative methods based on the hybrid steepest descent algorithms for solving variational inclusions, equilibrium problems. Our results unify, extend and improve the corresponding results given by many others.

• Journal of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.525-552
• /
• 2021

In this paper, we introduce two general iterative algorithms (one implicit algorithm and one explicit algorithm) for finding a common element of the solution set of the variational inequality problems for a continuous monotone mapping, the zero point set of a set-valued maximal monotone operator, and the fixed point set of a continuous pseudocontractive mapping in a Hilbert space. Then we establish strong convergence of the proposed iterative algorithms to a common point of three sets, which is a solution of a certain variational inequality. Further, we find the minimum-norm element in common set of three sets.