• Korean Journal of Mathematics
• /
• v.26 no.4
• /
• pp.777-798
• /
• 2018

In this paper, we study a new iterative method for solving mixed equilibrium problem and a common fixed point of a finite family of Bregman strongly nonexpansive mappings in the framework of reflexive real Banach spaces. Moreover, we prove a strong convergence theorem for finding common fixed points which also are solutions of a mixed equilibrium problem.

• Kyungpook Mathematical Journal
• /
• v.62 no.1
• /
• pp.89-106
• /
• 2022

We are concerned with finding a common solution to an equilibrium problem associated with a bifunction, and a constrained convex minimization problem. We propose an iterative fixed point algorithm and prove that the algorithm generates a sequence strongly convergent to a common solution. The common solution is identified as the unique solution of a certain variational inequality.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.451-474
• /
• 2021

In this paper, we investigate a hybrid algorithm for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators which is also a common fixed point problem for finite family of relatively quasi-nonexpansive mappings and split feasibility problem in uniformly convex real Banach spaces which are also uniformly smooth. The iterative algorithm employed in this paper is design in such a way that it does not require prior knowledge of operator norm. We prove a strong convergence result for approximating the solutions of the aforementioned problems and give applications of our main result to minimization problem and convexly constrained linear inverse problem.

• Communications of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.421-436
• /
• 2024

In this article, we propose a shrinking projection algorithm for solving a finite family of generalized equilibrium problem which is also a fixed point of a nonexpansive mapping in the setting of Hadamard manifolds. Under some mild conditions, we prove that the sequence generated by the proposed algorithm converges to a common solution of a finite family of generalized equilibrium problem and fixed point problem of a nonexpansive mapping. Lastly, we present some numerical examples to illustrate the performance of our iterative method. Our results extends and improve many related results on generalized equilibrium problem from linear spaces to Hadamard manifolds. The result discuss in this article extends and complements many related results in the literature.

• Nonlinear Functional Analysis and Applications
• /
• v.29 no.1
• /
• pp.69-81
• /
• 2024

In this paper, we provide certain fixed point results for a generalized 𝛼-nonexpansive mapping, as well as a new iterative algorithm called SRJ-iteration for approximating the fixed point of this class of mappings in the setting of CAT(0) spaces. Furthermore, we establish strong and ∆-convergence theorem for generalized 𝛼-nonexpansive mapping in CAT(0) space. Finally, we present a numerical example to illustrate our main result and then display the efficiency of the proposed algorithm compared to different iterative algorithms in the literature. Our results obtained in this paper improve, extend and unify results of Abbas et al. [10], Thakur et al. [22] and Piri et al. [19].

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.3
• /
• pp.553-568
• /
• 2022

In this paper, we introduce and study two different iterative hybrid projection algorithms for solving a fixed point problem of nonexpansive mappings. The first algorithm is generated by the combination of the inertial method and the hybrid projection method. On the other hand, the second algorithm is constructed by the convex combination of three updated vectors and the hybrid projection method. The strong convergence of the two proposed algorithms are proved under very mild assumptions on the scalar control. For illustrating the advantages of these two newly invented algorithms, we created some numerical results to compare various numerical performances of our algorithms with the algorithm proposed by Dong and Lu [11].

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1179-1191
• /
• 2011

In this paper, we introduce a new iterative scheme for finding a common element of the set of fixed points of a finite family of strict pseudocontractions and the solution set of pseudomonotone and Lipschitz-type continuous equilibrium problems. The scheme is based on the idea of extragradient methods and fixed point iteration methods. We show that the iterative sequences generated by this algorithm converge strongly to the common element in a real Hilbert space.

• Communications of the Korean Mathematical Society
• /
• v.25 no.3
• /
• pp.419-426
• /
• 2010

In this paper, a three-step iterative method is considered for finding a common element in the set of fixed points of a non-expansive mapping and in the set of solutions of a variational inclusion problem in a real Hilbert space.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.95-117
• /
• 2006

In this paper, we describe the optimization of the link-level performance and the complexity of floating-point and fixed-point methods in IEEE 802.16e OFDMA/TDD mobile modem. In floating-point design, we propose the channel estimation methods for downlink traffic channel and select the optimized method using computer simulation. So we also propose efficent algorithms for time and frequency synchronization, Digital Front End and CINR estimation scheme to optimize the system performance. Furthermore, we describe fixed-point method of uplink traffic and control channels. The superiority of the proposed algorithm is validated using the performances of Detection, False Alarm, Missing Probability and Mean Acquisition Time, PER Curve, etc. For fixed-point design, we propose an efficient methodology for optimized fixed-point design from floating-point At last, we design fixed-point of traffic channel, time and frequency synchronization, DFE block in uplink and downlink. The tradeoff between performance and complexity are optimized through computer simulations.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.5
• /
• pp.1527-1538
• /
• 2014

The purpose of this paper is to address the multiple split common fixed point problem. We present two different methods to approximate a solution of the problem. One is cyclic iteration method; the other is simultaneous iteration method. Under appropriate assumptions on the operators and iterative parameters, we prove both the proposed algorithms converge to the solution of the multiple split common fixed point problem. Our results generalize and improve some known results in the literatures.