Search

In this paper, we introduce and study a split minimization problem with multiple output sets. We propose a new iterative method, which employs the inertial Halpern approximation technique, for a common solution of the split minimization problem and the fixed point problem with a finite family of Bregman relatively nonexpansive mappings in the framework of p-uniformly convex and uniformly smooth Banach spaces. Our iterative method uses the step sizes which do not require prior knowledge of the operators norm, and we prove a strong convergence result under some mild conditions. Moreover, we present some applications of our result and further demonstrate the efficiency and applicability of our algorithm with some numerical examples. The results presented in this paper unify and complement several existing results in the literature. [ABSTRACT FROM AUTHOR]

A new inclusion problem is introduced using generalized Cayley operator and we call it Cayley inclusion problem. We also study its corresponding resolvent equation problem. By using a generalized resolvent operator and generalized Yosida approximation operator, first we establish a fixed point formulation for Cayley inclusion problem. An algorithm is defined to find the solution of Cayley inclusion problem. An existence and convergence result is proved. Secondly, we have shown the equivalence of Cayley inclusion problem with a resolvent equation. We define an iterative algorithm with some of its equivalent forms for solving resolvent equation problem. A numerical example is constructed and a convergence graph is shown by using MATLAB program. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to find a common element in the intersection of the set of zeros of the inclusion problem of sum of two monotone mappings and the set of fixed points of a Bregman quasi nonexpansive mapping in a reflexive Banach space by using Bregman distance and shrinking projection method. Under suitable conditions, some strong convergence theorems are proved. As applications, we utilize our results to study the convex minimization problem, variational inequality problem. [ABSTRACT FROM AUTHOR]

The problem of finding minima of weakly sequentially lower semicontinuous functions on reflexive Banach spaces is studied by means of convex and nonconvex subdifferentials. Finding a descent direction for a non-stationary point is a question of importance for many optimization algorithms. The existence or non-existence of such a direction is clarified through several theorems and a series of selective examples. For the general problem, a notion called radius of descent is proposed and shown to be useful for the analysis related to descent directions. [ABSTRACT FROM AUTHOR]

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 efficiently 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. [ABSTRACT FROM AUTHOR]

We study in this paper the existence and the approximation of solutions of variational inequalities involving generalized pseudocontractive mappings in Banach spaces. The convergence analysis of a proposed hybrid iterative method for approximating common zeros or fixed points of a possibly infinitely countable or uncountable family of such operators will be conducted within the conceptual framework of the "viscosity approximation technique" in reflexive Banach spaces with uniform Gâteaux differentiable norms. This technique should make existing or new results in solving variational inequalities more applicable. [ABSTRACT FROM AUTHOR]

The hybrid steepest-descent method introduced by Yamada (2001) is an algorithmic solution to the variational inequality problem over the fixed point set of nonlinear mapping and applicable to a broad range of convexly constrained nonlinear inverse problems in real Hilbert spaces. Lehdili and Moudafi (1996) introduced the new prox-Tikhonov regularization method for proximal point algorithm to generate a strongly convergent sequence and established a convergence property for it by using the technique of variational distance in Hilbert spaces. In this paper, motivated by Yamada's hybrid steepest-descent and Lehdili and Moudafi's algorithms, a generalized hybrid steepest-descent algorithm for computing the solutions of the variational inequality problem over the common fixed point set of sequence of nonexpansive-type mappings in the framework of Banach space is proposed. The strong convergence for the proposed algorithm to the solution is guaranteed under some assumptions. Our strong convergence theorems extend and improve certain corresponding results in the recent literature. [ABSTRACT FROM AUTHOR]

Let E be a uniformly convex and uniformly smooth Banach space with the dual E* and let T : E → 2E* be a maximal monotone operator. By using the technique of resolvent operators and by using modified Ishikawa iteration and modified Halpern iteration for relatively non-expansive mappings, we suggest and analyse two iterative algorithms for finding an element x ∈ E such that 0 ∈ T(x). Strong convergence theorems for such iterative algorithms are proved. The ideas of these algorithms are applied to solve the problem of finding a minimizer of a convex function on E. [ABSTRACT FROM AUTHOR]

In this article, we introduce two hybrid proximal-type algorithms and two hybrid shrinking projection algorithms by using the hybrid proximal-type method and the hybrid shrinking projection method, respectively, for finding a common element of the set of solutions of an equilibrium problem, the set of fixed points of a relatively nonexpansive mapping, and the set of solutions to the equation 0 ∈ Tx for a maximal monotone operator T defined on a uniformly smooth and uniformly convex Banach space. The strong convergence of the sequences generated by the proposed algorithms is established. Our results improve and generalize several known results in the literature. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce and study two hybrid proximal-point algorithms for finding a common element of the set of solutions of an equilibrium problem and the set of solutions to the equation 0∈ Tx for a maximal monotone operator T in a uniformly smooth and uniformly convex Banach space X. Strong and weak convergence results of these two hybrid proximal-point algorithms are established, respectively. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce a new system of generalized resolvent equations with corresponding system of variational inclusions in uniformly smooth Banach spaces. We establish an equivalence relation between system of generalized resolvent equations and system of variational inclusions. The iterative algorithms for finding the approximate solutions of system of generalized resolvent equations are proposed. The convergence of approximate solutions of system of generalized resolvent equations obtained by the proposed iterative algorithm is also studied. [ABSTRACT FROM AUTHOR]

Abstract: We obtain some point-based sufficient conditions for the metric regularity in Robinson’s sense of implicit multifunctions in a finite-dimensional setting. The new implicit function theorem (which is very different from the preceding results of Ledyaev and Zhu [Yu.S. Ledyaev, Q.J. Zhu, Implicit multifunctions theorems, Set-Valued Anal. 7 (1999) 209–238], Ngai and Théra [H.V. Ngai, M. Théra, Error bounds and implicit multifunction theorem in smooth Banach spaces and applications to optimization, Set-Valued Anal. 12 (2004) 195–223], Lee, Tam and Yen [G.M. Lee, N.N. Tam, N.D. Yen, Normal coderivative for multifunctions and implicit function theorems, J. Math. Anal. Appl. 338 (2008) 11–22]) can be used for analyzing parametric constraint systems as well as parametric variational systems. Our main tools are the concept of normal coderivative due to Mordukhovich and the corresponding theory of generalized differentiation. [Copyright &y& Elsevier]

In this paper, the hybrid steepest descent methods are extended to develop new iterative schemes for finding the zeros of bounded, demicontinuous and φ-strongly accretive mappings in uniformly smooth Banach spaces. Two iterative schemes are proposed. Strong convergence results are established and applications to variational inequalities are given. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce and study two new hybrid proximal-point algorithms for finding a common element of the set of solutions to a generalized equilibrium problem and the sets of zeros of two maximal monotone operators in a uniformly smooth and uniformly convex Banach space. We established strong and weak convergence theorems for these two modified hybrid proximal-point algorithms, respectively. [ABSTRACT FROM AUTHOR]

Let C be a nonempty closed convex subset of a Banach space E with the dual E*, let T : C → E* be a continuous mapping, and let S : C → C be a relatively nonexpansive mapping. In this paper, by employing the notion of generalized projection operator we study the variational inequality (for short, VI(T - f,C)): find x ϵ C such that ⩾ 0 for all y ϵ C, where f ϵ E* is a given element. By combining the approximate proximal point scheme both with the modified Ishikawa iteration and with the modified Halpern iteration for relatively nonexpansive mappings, respectively, we propose two modified versions of the approximate proximal point scheme L. C. Ceng and J. C. Yao (2008) for finding approximate solutions of the VI(T - f,C). Moreover, it is proven that these iterative algorithms converge strongly to the same solution of the VI(T - f,C), which is also a fixed point of S. [ABSTRACT FROM AUTHOR]

In this article, we established some solution existence theorems for implicit quasivariational inequalities. We first established some results in finite-dimensional spaces and then a solution existence result in infinite-dimensional spaces was derived. Our theorems are proved for discontinuous mappings and sets which may be unbounded. The results presented in this article are improvements of results in Cubiotti, and Yao (Cubiotti, P. and Yao, J.C., 1997, Discontinuous implicit quasi-variational inequalities with applications to fuzzy mappings. Mathematical Methods of Operations Research, 46, 213-328; Cubiotti, P. and Yao, J.C., 2007, Discontinuous implicit generalized quasi-variational inequalities in Banach spaces. Journal of Global Optimization (To appear)) [ABSTRACT FROM AUTHOR]

Let C be a nonempty closed convex subset of a real Banach space E. Let S: C → C be a quasi-nonexpansive mapping, let T: C → C be an asymptotically demicontractive and uniformly Lipschitzian mapping, and let F:= { x ε C: Sx = x and Tx = x} ≠ 0. Let { x n } n≥0 be the sequence generated from an arbitrary x 0 ε C by We prove the necessary and sufficient conditions for the strong convergence of the iterative sequence { x n } to an element of F. These extend and improve the recent results of Moore and Nnoli. [ABSTRACT FROM AUTHOR]

The article presents a discussion that looks into the wide class of inexact proximal-type methods for handling the generalized variational inequality problem with maximal monotone operator in a reflexive Banach space. An extension of Kamimura and Takahashi's algorithm is also provided with the aim of developing a generic inexact proximal point algorithm. A convergence analysis which unifies a broad class of proximal-type methods associated with finding Hilbert spaces or Banach spaces is also included.

This paper introduces an iterative method for finding approximate solutions of a set-valued mixed quasivariational inequality in the setting of a Banach space. Existence of a solution of this rather general problem and the convergence of the proposed iterative method to a solution are established. [ABSTRACT FROM AUTHOR]

In this paper, we consider an implicit quasivariational inequality without continuity assumptions in normed spaces. The main result (Theorem 2.1) provides an infinite-dimensional version of Theorem 3.2 in Ref. 1. To achieve such a goal, we employ Theorem 3.2 in Ref. 1 and the technique of Cubiotti in Ref. 2. In particular, Theorem 3.1 covers a recent result of Cubiotti (Theorem 3.1 of Ref. 2) as a special case. [ABSTRACT FROM AUTHOR]

Abstract: We introduce a new composite iterative scheme to approximate a zero of an -accretive operator defined on uniform smooth Banach spaces and a reflexive Banach space having a weakly continuous duality map. It is shown that the iterative process in each case converges strongly to a zero of . The results presented in this paper substantially improve and extend the results due to Ceng et al. [L.C. Ceng, H.K. Xu, J.C. Yao, Strong convergence of a hybrid viscosity approximation method with perturbed mappings for nonexpansive and accretive operators, Taiwanese J. Math. (in press)], Kim and Xu [T.H. Kim, H.K. Xu, Strong convergence of modified Mann iterations, Nonlinear Anal. 61 (2005) 51–60] and Xu [H.K. Xu, Strong convergence of an iterative method for nonexpansive and accretive operators, J. Math. Anal. Appl. 314 (2006) 631–643]. Our work provides a new approach for the construction of a zero of -accretive operators. [Copyright &y& Elsevier]