An iterative process for a finite family of Bregman totally quasi-asymptotically nonexpansive mappings and a system of generalized mixed equilibrium problems in reflexive Banach spaces

The equilibrium problem and its generalizations had a great influence in the development of some branches of pure and applied sciences. The equilibrium problems theory provides a natural and novel approach for some problems arising in nonlinear analysis, physics and engineering, image reconstruction, economics, finance, game theory and optimization. In recent times, there were many methods in order to solve the equilibrium problem and its generalizations. Some authors proposed many iterative methods and studied the convergence of such iterative methods for equilibrium problems and nonexpansive mappings in the setting of Hilbert spaces and Banach spaces. Note that a generalized mixed equilibrium problem is a generalization of an equilibrium problem and a Bregman totally quasi-asymptotically nonexpansive mapping is a generalization of a nonexpansive mapping in reflexive Banach spaces. The purpose of this paper is to combine the parallel method with the Bregman distance and the Bregman projection in order to introduce a new parallel hybrid iterative process which is to find common solutions of a finite family of Bregman totally quasi-asymptotically nonexpansive mappings and a system of generalized mixed equilibrium problems. After that, we prove that the proposed iteration strongly converges to the Bregman projection of initial element on the intersection of common fixed point set of a finite family of Bregman totally quasi-asymptotically nonexpansive mappings and the solution set of a system of generalized mixed equilibrium problems in reflexive Banach spaces. As application, we obatin some strong convergence results for a Bregman totally quasi-asymptotically nonexpansive mapping and a generalized mixed equilibrium problem in reflexive Banach spaces. These results are extensions and improvements to the main results in [7, 8]. In addition, a numerical example is provided to illustrate for the obtained result.

An inertial parallel algorithm for a finite family of $ G $-nonexpansive mappings applied to signal recovery

<abstract><p>This study investigates the weak convergence of the sequences generated by the inertial technique combining the parallel monotone hybrid method for finding a common fixed point of a finite family of $ G $-nonexpansive mappings under suitable conditions in Hilbert spaces endowed with graphs. Some numerical examples are also presented, providing applications to signal recovery under situations without knowing the type of noises. Besides, numerical experiments of the proposed algorithms, defined by different types of blurred matrices and noises on the algorithm, are able to show the efficiency and the implementation for LASSO problem in signal recovery.</p></abstract>

An Iterative Method for Solving Split Monotone Variational Inclusion Problems and Finite Family of Variational Inequality Problems in Hilbert Spaces

The purpose of this paper is to study the convergence analysis of an intermixed algorithm for finding the common element of the set of solutions of split monotone variational inclusion problem (SMIV) and the set of a finite family of variational inequality problems. Under the suitable assumption, a strong convergence theorem has been proved in the framework of a real Hilbert space. In addition, by using our result, we obtain some additional results involving split convex minimization problems (SCMPs) and split feasibility problems (SFPs). Also, we give some numerical examples for supporting our main theorem.

An inertial parallel algorithm for a finite family of G-nonexpansive mappings with application to the diffusion problem

For finding a common fixed point of a finite family of G-nonexpansive mappings, we implement a new parallel algorithm based on the Ishikawa iteration process with the inertial technique. We obtain the weak convergence theorem of this algorithm in Hilbert spaces endowed with a directed graph by assuming certain control conditions. Furthermore, numerical experiments on the diffusion problem demonstrate that the proposed approach outperforms well-known approaches.

Local Properties of Entropy for Finite Family of Functions

In this paper we consider the issues of local entropy for a finite family of generators (that generates the semigroup). Our main aim is to show that any continuous function can be approximated by s-chaotic family of generators.

Eckhoff's Problem on Convex Sets in the Plane

Eckhoff proposed a combinatorial version of the classical Hadwiger–Debrunner $(p,q)$-problems as follows. Let ${\cal F}$ be a finite family of convex sets in the plane and let $m\geqslant 1$ be an integer. If among every ${m+2\choose 2}$ members of ${\cal F}$ all but at most $m-1$ members have a common point, then there is a common point for all but at most $m-1$ members of ${\cal F}$. The claim is an extension of Helly's theorem ($m=1$). The case $m=2$ was verified by Nadler and by Perles. Here we show that Eckhoff 's conjecture follows from an old conjecture due to Szemerédi and Petruska concerning $3$-uniform hypergraphs. This conjecture is still open in general; its solution for a few special cases answers Eckhoff's problem for $m=3,4$. A new proof for the case $m=2$ is also presented.

On Turán exponents of bipartite graphs

A long-standing conjecture of Erdős and Simonovits asserts that for every rational number $r\in (1,2)$ there exists a bipartite graph H such that $\mathrm{ex}(n,H)=\Theta(n^r)$ . So far this conjecture is known to be true only for rationals of form $1+1/k$ and $2-1/k$ , for integers $k\geq 2$ . In this paper, we add a new form of rationals for which the conjecture is true: $2-2/(2k+1)$ , for $k\geq 2$ . This in turn also gives an affirmative answer to a question of Pinchasi and Sharir on cube-like graphs. Recently, a version of Erdős and Simonovits $^{\prime}$ s conjecture, where one replaces a single graph by a finite family, was confirmed by Bukh and Conlon. They proposed a construction of bipartite graphs which should satisfy Erdős and Simonovits $^{\prime}$ s conjecture. Our result can also be viewed as a first step towards verifying Bukh and Conlon $^{\prime}$ s conjecture. We also prove an upper bound on the Turán number of theta graphs in an asymmetric setting and employ this result to obtain another new rational exponent for Turán exponents: $r=7/5$ .

Strong convergence theorems for variational inequalities and fixed point problems in Banach spaces

In this paper, using a sunny generalized non-expansive retraction which is different from the metric projection and generalized metric projection in Banach spaces, we present a retractive iterative algorithm of Krasnosel’skii-type, whose sequence approximates a common solution of a mono-variational inequality of a finite family of η-strongly-pseudo-monotone-type maps and fixed points of a countable family of generalized non-expansive-type maps. Furthermore, some new results relevant to the study are also presented. Finally, the theorem proved complements, improves and extends some important related recent results in the literature.