An iterative algorithm for solving split equality fixed point problems for a class of nonexpansive-type mappings in Banach spaces

In this paper, an iterative algorithm that approximates solutions of split equality fixed point problems (SEFPP) for quasi-?-nonexpansive mappings is constructed. Weak convergence of the sequence generated by this algorithm is established in certain real Banach spaces. The theorem proved is applied to solve split equality problem, split equality variational inclusion problem, and split equality equilibrium problem. Finally, some numerical examples are given to demonstrate the convergence of the algorithm. The theorems proved improve and complement a host of important recent results.

     

An iterative algorithm for solving split equilibrium problems and split equality variational inclusions for a class of nonexpansive-type maps

ABSTRACT

In this paper, an iterative algorithm that approximates solutions of split equality fixed point problems (SEFPP) for quasi-φ-nonexpansive maps is constructed. Strong convergence of the sequence generated by this algorithm is established in certain real Banach spaces without imposing any compactness-type condition on either the operators or the space considered. We applied our theorem to solve split equality problem, split equality variational inclusion problem and split equality equilibrium problem. Furthermore, some numerical example is given to demonstrate the implementability of our algorithm. Finally, our theorems improve and complement a host of important recent results.     

A new projection algorithm for solving constrained equilibrium problems in Hilbert spaces

ABSTRACT

In this paper, we introduce a new iterative scheme by combining the hyperplane projection method and the inertial technique for constrained equilibrium problems in real Hilbert spaces. The convergence of the proposed algorithm is established without requiring strict paramonotonicity property. The results presented in the paper extend and improve some recent results in the literature. In addition, a numerical example is given to illustrate the efficiency and performance of the proposed method.     

On inertial proximal algorithm for split variational inclusion problems

ABSTRACT

In this paper, a hybrid proximal algorithm with inertial effect is introduced to solve a split variational inclusion problem in real Hilbert spaces. Under mild conditions on the parameters, we establish weak convergence results for the proposed algorithm. Unlike the earlier iterative methods, we do not impose any conditions on the sequence generated by the proposed algorithm. Also, we extend our results to find a common solution of a split variational inclusion problem and a fixed-point problem. Finally, some numerical examples are given to discuss the convergence and superiority of the proposed iterative methods.     

Split common fixed point problems for demicontractive operators

In this paper, first, we introduce a new iterative algorithm involving demicontractive mappings in Hilbert spaces and, second, we prove some strong convergence theorems of the proposed method with the Armijo-line search to show the existence of a solution of the split common fixed point problem. Finally, we give some numerical examples to illustrate our main results.

     

STRONGLY CONVERGENT ITERATIVE METHODS FOR SPLIT EQUALITY VARIATIONAL INCLUSION PROBLEMS IN BANACH SPACES

The purpose of this paper is to introduce and study the split equality variational inclusion problems in the setting of Banach spaces.For solving this kind of problems,some new iterative algorithms are proposed.Under suitable conditions,some strong convergence theorems for the sequences generated by the proposed algorithm are proved.As applications,we shall utilize the results presented in the paper to study the split equality feasibility problems in Banach spaces and the split equality equilibrium problem in Banach spaces.The results presented in the paper are new.     

Nonlinear iteration method for proximal split feasibility problems

The purpose of this paper is to introduce iterative algorithm which is a combination of hybrid viscosity approximation method and the hybrid steepest‐descent method for solving proximal split feasibility problems and obtain the strong convergence of the sequences generated by the iterative scheme under certain weaker conditions in Hilbert spaces. Our results improve many recent results on the topic in the literature. Several numerical experiments are presented to illustrate the effectiveness of our proposed algorithm, and these numerical results show that our result is computationally easier and faster than previously known results on proximal split feasibility problem.     

Krasnoselski-Mann type iterative method for hierarchical fixed point problem and split mixed equilibrium problem

In this paper, we suggest and analyze a Krasnoselski-Mann type iterative method to approximate a common element of solution sets of a hierarchical fixed point problem for nonexpansive mappings and a split mixed equilibrium problem. We prove that sequences generated by the proposed iterative method converge weakly to a common element of solution sets of these problems. Further, we derive some consequences from our main result. Furthermore, we extend the considered iterative method to a split monotone variational inclusion problem and deduce some consequences. Finally, we give a numerical example to justify the main result. The method and results presented in this paper generalize and unify the corresponding known results in this area.     

A new simultaneous iterative method with a parameter for solving the extended split equality problem and the extended split equality fixed point problem

In this article, we first propose an extended split equality problem which is an extension of the convex feasibility problem, and then introduce a parameter w to establish the fixed point equation system. We show the equivalence of the extended split equality problem and the fixed point equation system. Based on the fixed point equation system, we present a simultaneous iterative algorithm and obtain the weak convergence of the proposed algorithm. Further, by introducing the concept of a G-mapping of a finite family of strictly pseudononspreading mappings \(\{T_{i}\}_{i = 1}^{N}\), we consider an extended split equality fixed point problem for G-mappings and give a simultaneous iterative algorithm with a way of selecting the stepsizes which do not need any prior information about the operator norms, and the weak convergence of the proposed algorithm is obtained. We apply our iterative algorithms to some convex and nonlinear problems. Finally, several numerical results are shown to confirm the feasibility and efficiency of the proposed algorithms.     

Numerical solutions to large-scale differential Lyapunov matrix equations

In this paper, we introduce an extension of multiple set split variational inequality problem (Censor et al. Numer. Algor. 59, 301–323 2012) to multiple set split equilibrium problem (MSSEP) and propose two new parallel extragradient algorithms for solving MSSEP when the equilibrium bifunctions are Lipschitz-type continuous and pseudo-monotone with respect to their solution sets. By using extragradient method combining with cutting techniques, we obtain algorithms for these problems without using any product space. Under certain conditions on parameters, the iteration sequences generated by the proposed algorithms are proved to be weakly and strongly convergent to a solution of MSSEP. An application to multiple set split variational inequality problems and a numerical example and preliminary computational results are also provided.     

A new hybrid iterative method for mixed equilibrium problems and variational inequality problem for relaxed cocoercive mappings with application to optimization problems

In this paper, we introduce and study a new hybrid iterative method for finding a common element of the set of solutions of a mixed equilibrium problem, the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of variational inequalities for a ξ-Lipschitz continuous and relaxed (m,v)-cocoercive mappings in Hilbert spaces. Then, we prove a strong convergence theorem of the iterative sequence generated by the proposed iterative algorithm which solves some optimization problems under some suitable conditions. Our results extend and improve the recent results of Yao et al. [Y. Yao, M.A. Noor, S. Zainab and Y.C. Liou, Mixed equilibrium problems and optimization problems, J. Math. Anal. Appl (2009). doi:10.1016/j.jmaa.2008.12.005] and Gao and Guo [X. Gao and Y. Guo, Strong convergence theorem of a modified iterative algorithm for Mixed equilibrium problems in Hilbert spaces, J. Inequal. Appl. (2008). doi:10.1155/2008/454181] and many others.     

与渐近非扩张半群不动点问题相关的分裂等式混合均衡问题及其应用

研究了与渐近非扩张半群不动点问题相关的分裂等式混合均衡问题.在等式约束下,为同时逼近两个空间中混合均衡问题和渐近非扩张半群不动点问题的公共解,借助收缩投影方法引出了一种迭代程序.在适当条件下,该迭代算法的强收敛性被证明.文末还把所得结果应用于分裂等式混合变分不等式问题和分裂等式凸极小化问题.     

Hilbert空间中求解分裂可行问题CQ算法的强收敛性

在Hilbert空间中,为了研究分裂可行问题迭代算法的强收敛性,提出了一种新的CQ算法.首先利用CQ算法构造了一个改进的Halpern迭代序列； 然后通过把分裂可行问题转化为算子不动点， 在较弱的条件下， 证明了该序列强收敛到分裂可行问题的一个解. 推广了Wang和Xu的有关结果.     

Iterative methods for solving monotone equilibrium problems via dual gap functions

This paper proposes an iterative method for solving strongly monotone equilibrium problems by using gap functions combined with double projection-type mappings. Global convergence of the proposed algorithm is proved and its complexity is estimated. This algorithm is then coupled with the proximal point method to generate a new algorithm for solving monotone equilibrium problems. A class of linear equilibrium problems is investigated and numerical examples are implemented to verify our algorithms.     

Strong Convergence Theorem for Multiple Sets Split Feasibility Problems in Banach Spaces

The purpose of this article is to study the iterative approximation of solution to multiple sets split feasibility problems in p-uniformly convex real Banach spaces that are also uniformly smooth. We propose an iterative algorithm for solving multiple sets split feasibility problems and prove a strong convergence theorem of the sequence generated by our algorithm under some appropriate conditions in p-uniformly convex real Banach spaces that are also uniformly smooth.     

A general iterative method for addressing mixed equilibrium problems and optimization problems

In this paper, we introduce a new general iterative method for finding a common element of the set of solutions of a mixed equilibrium problem (MEP), the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of variational inequalities for a ξ-inverse-strongly monotone mapping in Hilbert spaces. Furthermore, we establish the strong convergence theorem for the iterative sequence generated by the proposed iterative algorithm under some suitable conditions, which solves some optimization problems. Our results extend and improve the recent results of Yao et al. [Y. Yao, M.A. Noor, S. Zainab, Y.C. Liou, Mixed equilibrium problems and optimization problems, J. Math. Anal. Appl. 354 (2009) 319-329; Y. Yao, M. A. Noor, Y.C. Liou, On iterative methods for equilibrium problems, Nonlinear Anal. 70 (1) (2009) 479-509] and many others.     

An iterative substructuring algorithm for equilibrium equations

Summary The topic of iterative substructuring methods, and more generally domain decomposition methods, has been extensively studied over the past few years, and the topic is well advanced with respect to first and second order elliptic problems. However, relatively little work has been done on more general constrained least squares problems (or equivalent formulations) involving equilibrium equations such as those arising, for example, in realistic structural analysis applications. The potential is good for effective use of iterative algorithms on these problems, but such methods are still far from being competitive with direct methods in industrial codes. The purpose of this paper is to investigate an order reducing, preconditioned conjugate gradient method proposed by Barlow, Nichols and Plemmons for solving problems of this type. The relationships between this method and nullspace methods, such as the force method for structures and the dual variable method for fluids, are examined. Convergence properties are discussed in relation to recent optimality results for Varga's theory ofp-cyclic SOR. We suggest a mixed approach for solving equilibrium equations, consisting of both direct reduction in the substructures and the conjugate gradient iterative algorithm to complete the computations.Dedicated to R. S. Varga on the occasion of his 60th birthdayResearch completed while pursuing graduate studies sponsored by the Department of Mathematical Sciences, US Air Force Academy, CO, and funded by the Air Force Institute of Technology, WPAFB, OHResearch supported by the Air Force under grant no. AFOSR-88-0285 and by the National Science Foundation under grant no. DMS-89-02121     

On the Iterations of a Sequence of Strongly Quasi-Nonexpansive Mappings with Applications

Abstract

In this article, we study Δ-convergence of iterations for a sequence of strongly quasi-nonexpansive mappings as well as the strong convergence of the Halpern type regularization of them in Hadamard spaces. Then, we give some their applications to iterative methods, convex and pseudo-convex minimization (proximal point algorithm), fixed point theory and equilibrium problems. The results extend several new results in the literature and some of them seem new even in Hilbert spaces. One of our motivations is to unify some usual iterative methods in fixed point theory and proximal methods using the iterations generated by a sequence of strongly nonexpansive mappings.     

An iterative approximation method for solving a general system of variational inequality problems and mixed equilibrium problems

In this paper, we introduce an iterative algorithm for finding a common element of the set of solutions of a mixed equilibrium problem, the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of a general system of variational inequalities for a cocoercive mapping in a real Hilbert space. Furthermore, we prove that the proposed iterative algorithm converges strongly to a common element of the above three sets. Our results extend and improve the corresponding results of Ceng, Wang, and Yao [L.C. Ceng, C.Y. Wang, J.C. Yao, Strong convergence theorems by a relaxed extragradient method for a general system of variational inequalities, Math. Methods Oper. Res. 67 (2008) 375–390], Ceng and Yao [L.C. Ceng, J.C. Yao, A hybrid iterative scheme for mixed equilibrium problems and fixed point problems, J. Comput. Appl. Math. doi:10.1016/j.cam.2007.02.022], Takahashi and Takahashi [S. Takahashi, W. Takahashi, Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 331 (2007) 506–515] and many others.     

A projection iterative algorithm for strong vector equilibrium problem

In this paper, iterative algorithm for strong vector equilibrium problem (SVEP) is studied. Firstly, an auxiliary problem for SVEP is introduced and the relationships between these two problems are discussed. Then, based on the auxiliary problem, a projection iterative algorithm for SVEP is proposed. Moreover, analysis of convergence of this iterative algorithm is investigated under suitable conditions of continuity and convexity. The main result obtained in this paper generalizes and improves the corresponding ones of Iusem and Sosa [Iusem AN, Sosa W. Iterative algorithms for equilibrium problems. Optimization. 2003;52(3):301–316.] and Cheng and Liu [Cheng B, Liu SY. An iterative algorithm for vector equilibrium problems. J. Lanzhou Univ. (Nat. Sci.). 2009;45(5):105–109.].