The purpose of this article is to study the fixed point and weak convergence problem for the new defined class of point-dependent λ-hybrid mappings relative to a Bregman distance D f in a Banach space. We at first extend the Aoyama-Iemoto-Kohsaka-Takahashi fixed point theorem for λ-hybrid mappings in Hilbert spaces in 2010 to this much wider class of nonlinear mappings in Banach spaces. Secondly, we derive an Opial-like inequality for the Bregman distance and apply it to establish a weak convergence theorem for this new class of nonlinear mappings. Some concrete examples in a Hilbert space showing that our extension is proper are also given. 2010 MSC: 47H09; 47H10.

The in-process inspection procedure is one of the critical operations in the active pharmaceutical ingredients manufacturing process. This study aims to improve the performance of the IPI service system in terms of three main criteria, namely service level, cycle time, and maximum tardy time. In solving this multiple-criteria decision-making problem, the proposed study seeks to redesign three process control factors, namely the service configuration, the dispatching rule, and the scheduling rule. The problem is solved using the Taguchi robust design methodology. Since the Taguchi method handles parameter design problems with only one criterion, Technique for Order Preference by Similarity to an Ideal Solution, a multiple-criteria decision-making method, is used to provide a surrogate response to the Taguchi method. The numerical results show that the redesigned IPI system improves the service level by 28.75%, the cycle time by 18.32%, and the maximum tardy time by 22.22%.

In this paper, a modified proximal point algorithm for finding common fixed points of averaged self-mappings in Hilbert spaces is introduced and a strong convergence theorem associated with it is proved. As a consequence, we apply it to study the split feasibility problem, the zero point problem of maximal monotone operators, the minimization problem and the equilibrium problem, and to show that the unique minimum norm solution can be obtained through our algorithm for each of the aforementioned problems. Our results generalize and unify many results that occur in the literature.

We at first raise the so called split feasibility fixed point problem which covers the problems of split feasibility, convex feasibility, and equilibrium as special cases and then give two types of algorithms for finding solutions of this problem and establish the corresponding strong convergence theorems for the sequences generated by our algorithms. As a consequence, we apply them to study the split feasibility problem, the zero point problem of maximal monotone operators, and the equilibrium problem and to show that the unique minimum norm solutions of these problems can be obtained through our algorithms. Since the variational inequalities, convex differentiable optimization, and Nash equilibria in noncooperative games can be formulated as equilibrium problems, each type of our algorithms can be considered as a generalized methodology for solving the aforementioned problems.

The main aim of this article is to propose a method for exploring the latent values about the capacities of spreading dengue for each potential site. First, a mathematical model connecting the observable public data and the capacities of spreading dengue is provided based on the split feasibility problem (SFP). Then, a proper iterative scheme for the SFP is presented to approach the values of infectious capacities (ICs) of potential sites—the capacities of spreading. The performance of our proposed method is demonstrated using public data from Kaohsiung City for 2014 and 2015. The results presented in this paper show that our proposed method is reliable and the sites with a high capacity of spreading are only a small portion of thousands of all potential sites and could be an alternative strategy for preventing the outbreak of dengue fever whilst also avoiding the damage of ecosystems caused by chemical insecticides.