Search

Very recently, the notion of graphical rectangular b -metric spaces has been introduced, where the weight of the symmetric edges endowing the directed graph is defined in terms of the underlying metric. Due to its intimate relationship with the directed graphs, such spaces have a wide range of applications in science and engineering. In this paper, we rectify some errors that arose in the paper [Younis et al., A novel approach of graphical rectangular b -metric spaces with an application to the vibrations of a vertical heavy hanging cable, J. Fixed Point Theory Appl. 21(1) (2019) 33]. We show that the main result of the paper described above can be modified, and we present the same in this note. [ABSTRACT FROM AUTHOR]

This paper is concerned with the system (NEESSVMEP) obtained by mixing a nonlinear evolutionary equation and a strong set-valued mixed equilibrium problem (SSVMEP). In our setting, the set of constraints is not necessarily compact and the problem is driven by a not necessarily monotone set-valued mapping. We show that the solution set for (SSVMEP) is nonempty, closed, convex and bounded. We then establish the upper semicontinuity and the measurability properties of the involved functions in the nonlinear evolutionary equation. Utilizing these results, we prove that the solution set for (NEESSVMEP) is nonempty and compact. [ABSTRACT FROM AUTHOR]

We study perturbations of a hybrid steepest descent method for locating common fixed points of an arbitrary pool { T λ } of nonexpansive mappings. The difficulty of handling a possibly uncountable family is settled down to dealing with a countable family of auxiliary mappings { S n } associated to { T λ } , in the sense that the approximate fixed points of { S n } provide the common fixed points of { T λ }. Algorithms with strong convergence for solving the associated variational inequality problems are presented. Applications to convex minimization problems and convex feasibility problems are provided, together with numerical examples for comparisons of our algorithms with the existing ones. [ABSTRACT FROM AUTHOR]

In this paper, the method of measuring the porosity of electrostatic nanofiber membrane by VC++ and Matlab is introduced. It is found that the ratio of the calculated porosity to the porosity measured by the mercury intrusion method accords with the famous Feigenbaum constant (α = 2.5029078750957 ⋯). The porosity distribution of nanofiber membranes was studied by VC++ and Matlab based on the image obtained by using a scanning electron microscope. The porosity distribution calculated by using a computer is magnified by e α times which was named as relative porosity distribution. According to the relative porosity distribution, we use the algorithm proposed by Grassberger and Procaccia (briefly referred to as the G-P algorithm) to calculate the correlation fractal dimension. The correlation fractal dimension calculated from the relative porosity distribution series was between 1 and 2, consistent with geometric characteristics of coincidence samples. The fractal meaning of the Feigenbaum constant was verified again. In the end, we obtained the relationship between the associated fractal dimension and the filtration resistance by fitting in accordance with the secondary function relationship and reached the maximum correlation fractal dimension when the filtration resistance was 15–20 pa. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to propose an iterative algorithm for solving the split equality common null point problem (SECNP), which is to find an element of the set of common zero points for a finite family of maximal monotone operators in Hilbert spaces. We introduce the concept of bounded linear regularity for the SECNP and construct several sufficient conditions to ensure the linear convergence of the algorithm. Moreover, some numerical experiments are given to test the validity of our results. [ABSTRACT FROM AUTHOR]

The Opial property of Hilbert spaces is essential in many fixed point theorems of non-expansive maps. While the Opial property does not hold in every Banach space, the Bregman–Opial property does. This suggests to study fixed point theorems for various Bregman non-expansive like maps in the general Banach space setting. In this paper, after introducing the notion of Bregman generalized hybrid sequences in a reflexive Banach space, we prove (with using the Bregman–Opial property instead of the Opial property) convergence theorems for such sequences. We also provide new fixed point theorems for Bregman generalized hybrid maps defined on an arbitrary but not necessarily convex subset of a reflexive Banach space. We end this paper with a brief discussion of the existence of Bregman absolute fixed points of such maps. [ABSTRACT FROM AUTHOR]

The inverse problem is one of the four major problems in computational mathematics. There is an inverse problem in medical image reconstruction and radiotherapy that is called the multiple-sets split equality problem. The multiple-sets split equality problem is a unified form of the split feasibility problem, split equality problem, and split common fixed point problem. In this paper, we present two iterative algorithms for solving it. The suggested algorithms are based on the gradient method with a selection technique. Based on this technique, we only need to calculate one projection in each iteration. [ABSTRACT FROM AUTHOR]

In this paper, we propose the simultaneous sub-gradient projection algorithm with the dynamic step size (SSPA for short) for solving the multiple-sets split feasibility problem (MSSFP for short) and investigate its linear convergence. We involve a notion of bounded linear regularity for the MSSFP and construct several sufficient conditions to prove the linear convergence for the SSPA. In particular, the SSPA is an easily calculated algorithm that uses orthogonal projection onto half-spaces. Furthermore, some numerical results are provided to verify the effectiveness of our proposed algorithm. [ABSTRACT FROM AUTHOR]