Search

In this paper, we consider a variational inequality problem which is defined over the intersection of the set of common fixed points of a finite family of generalized demimetric mappings and the set of common zero points of a finite family of maximal monotone mappings. We propose an iterative algorithm which combines the hybrid steepest descent method with the inertial technique to solve this variational inequality problem. Strong convergence theorem of the proposed method is established under standard and mild conditions. Moreover, we do not require any prior information regarding the Lipschitz and strongly monotone constants of the mapping. The results of this paper improve and extend several known results in the literature. [ABSTRACT FROM AUTHOR]

In this paper, firstly, we extend the nonlinear Lebesgue spaces from the setting of Hadamard spaces to the setting of p-uniformly convex metric spaces. Afterward, we establish some Δ-convergence and strong convergence theorems for a recently introduced class of generalized nonexpansive mappings in the setting of p-uniformly convex metric spaces. Furthermore, we employ the newly introduced JK-iteration process to approximate the fixed points of this class. Finally, we construct new examples of this class of mappings in the context of p-uniformly convex metric spaces. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the problem of solving strongly monotone variational inequality problems over the solution set of the split feasibility problem with multiple output sets in real Hilbert spaces. The strong convergence of the proposed algorithm is proved without knowing any information of the Lipschitz and strongly monotone constants of the mapping. In addition, the implementation of the algorithm does not require the computation or estimation of the norms of the given bounded linear operators. Special cases are considered. Finally, a numerical experiment has been carried out to illustrate the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we consider a penalty method for a class of differential hemivariational inequalities in reflexive Banach spaces, governed by a set of constraints. First, we recall the existence and uniqueness result of the differential hemivariational inequality. Further, we introduce a penalized problem without constraints and we prove that, as a penalty parameter tends to zero, the solution of the original inequality can be approached to the solution of the penalized problem. Finally, we illustrate our results by an example of a contact problem for which our abstract results can be applied. [ABSTRACT FROM AUTHOR]

In this paper, we discuss about monotone vector fields, which is a typical extension to the theory of convex functions, by exploiting the tangent space structure. This new approach to monotonicity in CAT (0) spaces stands in opposed to the monotonicity defined earlier in CAT (0) spaces by Khatibzadeh and Ranjbar [J. Aust. Math. Soc. 103(1), 70–90 (2017).] and Chaipunya and Kumam [Optimization 66(10), 1647–1665 (2017).]. In particular, this new concept extends the theory from both Hilbert spaces and Hadamard manifolds, while the known concept barely has any obvious relationship to the theory in Hadamard manifolds. We also study the corresponding resolvents and Yosida approximations of a given monotone vector field and derive many of their important properties. Finally, we prove a generation theorem by showing convergence of an exponential formula applied to resolvents of a monotone vector field. Our findings improve several known results in the literature including generation theorems of Jost [AMS/IP Stud. Adv. Math., vol. 8, pp. 1–47. Amer. Math. Soc., Providence, RI (1998)], Mayer [Comm. Anal. Geom. 6(2), 199–253 (1998).], Stojkovic [Adv. Calc. Var. 5(1), 77–126 (2012).], and Bačák [Convex analysis and optimization in Hadamard spaces, De Gruyter Series in Nonlinear Analysis and Applications, vol. 22. De Gruyter, Berlin (2014).] for proper, convex, lower semicontinuous functions in the context of complete CAT (0) spaces, and also by Iwamiya and Okochi [Nonlinear Anal. 54(2), 205–214 (2003).] for monotone vector fields in the context of Hadamard manifolds. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new system of variational inclusion problems called system of generalized set-valued variational inclusion problems involving α β - H ((. ,.) , (. ,.)) -mixed accretive mapping in q-uniformly smooth Banach spaces. By means of proximal-point mapping method, we prove the existence of solution of this system of variational inclusions. Further, we propose an iterative algorithm for finding the approximate solution of the system. Furthermore, we prove that the sequences generated by the iterative algorithm converge strongly to a solution of the system. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce an iterative method for approximating a point in the set of zeros of the sum of two monotone mappings, which is also a solution of a fixed point problem for a Bregman strongly nonexpansive mapping in a real reflexive Banach space. With our iterative technique, we state and prove a strong convergence theorem for approximating an element in the intersection of the set of solutions of a variational inclusion problem for sum of two monotone mappings and the set of solutions of a fixed point problem for Bregman strongly nonexpansive mapping. We give applications of our result to convex minimization problem, convex feasibility problem, variational inequality problem, and equilibrium problem. Our result complements and extends some recent results in literature. [ABSTRACT FROM AUTHOR]

In this paper, we regard theCQalgorithm as a fixed point algorithm for averaged mapping, and also try to study the split feasibility problem by the following hybrid steepest method;where {αn}⊂(0,1). It is noted that Xu’s original iterative method can conclude only weak convergence. Consequently, we obtain the sequence {xn} generated by our iteration method converges strongly to, whereis the unique solution of the variational inequalityOur result extends and improves the result of Xu, as shown in the literature, from weak to strong convergence theorems. Finally, in the last section, numerical examples for study behavior convergence analysis of this algorithm are obtained. [ABSTRACT FROM AUTHOR]

In this paper, we propose three different kinds of iteration schemes to compute the approximate solutions of variational inequalities in the setting of Banach spaces. First, we suggest Mann-type steepest-descent iterative algorithm, which is based on two well-known methods: Mann iterative method and steepest-descent method. Second, we introduce modified hybrid steepest-descent iterative algorithm. Third, we propose modified hybrid steepest-descent iterative algorithm by using the resolvent operator. For the first two cases, we prove the convergence of sequences generated by the proposed algorithms to a solution of a variational inequality in the setting of Banach spaces. For the third case, we prove the convergence of the iterative sequence generated by the proposed algorithm to a zero of an operator, which is also a solution of a variational inequality. [ABSTRACT FROM AUTHOR]

In this paper, we develop a new mixed Mann iteration process to approximate the fixed points of mixed increasing operators in ordered Banach spaces and discuss the convergence analysis of the iterative sequences generated by the iteration process. As an application, we develop a new iterative method for solving a class of nonlinear integral equations. [ABSTRACT FROM AUTHOR]