Search

We introduce a novel class of asymptotically α-hemicontractive mappings and demonstrate its relationship with the existing related families of mappings. We establish certain interesting properties of the fixed point set of the new class of mappings. Furthermore, we propose and investigate a new iterative algorithm for solving split common fixed point problem for the new class of mappings. In particular, weak and strong convergence theorems for solving split common fixed point problem for our new class of mappings in Hilbert spaces are proved. Moreover, using our method, we require no prior knowledge of norm of the transfer operator. The results presented in the paper extend and improve the results of Censor and Segal [Censor, Y.; Segal, A. The split common fixed point problem for directed operators. J. Convex Anal. 16 (2009), no. 2, 587-600.], Moudafi [Moudafi, A. The split common fixed-point problem for demicontractive mappings. Inverse Problems 26 (2010), no. 5:055007.; Moudafi, A. A note on the split common fixed-point problem for quasi-nonexpansive operators. Nonlinear Anal. 74 (2011), no. 12, 4083-4087.], Chima and Osilike [Chima, E. E.; Osilike, M. O. Split common fixed point problem for class of asymptotically hemicontractive mappings. J. Nigerian Math. Soc. 38 (2019), no. 3, 363-390.], Fan et al [Fan, Q.; Peng, J.; He, H. Weak and strong convergence theorems for the split common fixed point problem with demicontractive operators. Optimization 70 (2021), no. 5-6, 1409-1423.] and host of other related results in literature. [ABSTRACT FROM AUTHOR]

A new numerical approximation method for a class of Gaussian random fields on compact connected oriented Riemannian manifolds is introduced. This class of random fields is characterized by the Laplace–Beltrami operator on the manifold. A Galerkin approximation is combined with a polynomial approximation using Chebyshev series. This so-called Galerkin–Chebyshev approximation scheme yields efficient and generic sampling algorithms for Gaussian random fields on manifolds. Strong and weak orders of convergence for the Galerkin approximation and strong convergence orders for the Galerkin–Chebyshev approximation are shown and confirmed through numerical experiments. [ABSTRACT FROM AUTHOR]

Fixed point theory is a branch of mathematics that studies solutions that remain unchanged under a given transformation or operator, and it has numerous applications in fields such as mathematics, economics, computer science, engineering, and physics. In the present article, we offer a quicker iteration technique, the D * * iteration technique, for approximating fixed points in generalized α -nonexpansive mappings and nearly contracted mappings. In uniformly convex Banach spaces, we develop weak and strong convergence results for the D * * iteration approach to the fixed points of generalized α -nonexpansive mappings. In order to demonstrate the effectiveness of our recommended iteration strategy, we provide comprehensive analytical, numerical, and graphical explanations. Here, we also demonstrate the stability consequences of the new iteration technique. We approximately solve a fractional Volterra–Fredholm integro-differential problem as an application of our major findings. Our findings amend and expand upon some previously published results. [ABSTRACT FROM AUTHOR]

This paper derives a free analogue of the Euler-Maruyama method (fEMM) to numerically approximate solutions of free stochastic differential equations (fSDEs). Simply speaking, fSDEs are SDEs in the context of noncommutative random variables (e.g., large random matrices). By applying the theory of multiple operator integrals, we derive a free Itô formula from Taylor expansion of operator-valued functions. Iterating the free Itô formula allows us to motivate and define fEMM. Then we consider weak and strong convergence in the fSDE setting and prove strong convergence order of 1/2 and weak convergence order of 1. Numerical examples support the theoretical results and show solutions for equations where no analytical solution is known. [ABSTRACT FROM AUTHOR]

In this paper, we introduce two modified Tseng's extragradient algorithms with a new generalized adaptive stepsize for solving monotone variational inequalities (VI) in reflexive Banach spaces. The advantage of our methods is that stepsizes do not require prior knowledge of the Lipschitz constant of the cost mapping. Based on Bregman projection-type methods, we prove weak and strong convergence of the proposed algorithms to a solution of VI. Some numerical experiments to show the efficiency of our methods including a comparison with related methods are provided. [ABSTRACT FROM AUTHOR]

To address the split best proximity point and monotone variational inclusion problems in real Hilbert spaces, we present and investigate projection and viscosity approximation methods. Under a few reasonable assumptions, we prove some weak and strong convergence theorems for the aforementioned methods. The efficiency of the proposed method is demonstrated by some numerical examples. Some well-known recent results in this area have been improved, generalized, and extended as an outcome of this paper. [ABSTRACT FROM AUTHOR]

This paper aims to present two inertial iterative algorithms for estimating the solution of split variational inclusion (S p VI s P) and its extended version for estimating the common solution of (S p VI s P) and fixed point problem (FPP) of a nonexpansive mapping in the setting of real Hilbert spaces. We establish the weak convergence of the proposed algorithms and strong convergence of the extended version without using the pre-estimated norm of a bounded linear operator. We also exhibit the reliability and behavior of the proposed algorithms using appropriate assumptions in a numerical example. [ABSTRACT FROM AUTHOR]

We study a perturbed inertial Krasnoselskii-Mann-type algorithm and prove that the algorithm is an approximate fixed point sequence for Lipschitz pseudocontractive maps in arbitrary real Banach spaces. Strong convergence results are then established for our inertial iteration scheme for approximation of fixed points of Lipschitz pseudocontractive maps and solutions of certain important accretive-type operator equations in certain real Banach spaces. Implementation of our algorithm is illustrated using numerical examples in both finite and infinite dimensional Banach spaces. Our results improve rate of convergence and extend several related recent results. [ABSTRACT FROM AUTHOR]

In this work, we introduce and study the modified inertial Mann’s algorithm and inertial hybrid algorithm for approximating some fixed points of a k-strict pseudo-contractive mapping in Hilbert spaces. Weak convergence to a solution of fixed-point problems for a k-strict pseudo-contractive mapping is obtained by using the modified inertial Mann’s algorithm. In order to obtain strong convergence, we introduce an inertial hybrid algorithm by using the inertial extrapolation method mixed with the convex combination of three iterated vectors and forcing for strong convergence by the hybrid projection method for a k-strict pseudo-contractive mapping in Hilbert spaces. The strong convergence theorem of the proposed method is proved under mild assumptions on the scalars. For illustrating the performance of the proposed algorithms, we provide some new nonlinear k-strict pseudo-contractive mappings which are not nonexpansive to create some numerical experiments to show the advantage of the two new inertial algorithms for a k-strict pseudo-contractive mapping. [ABSTRACT FROM AUTHOR]

In this work, we establish two new self-adaptive parallel algorithms to solve the generalized split common fixed point problem which is to find a point which belongs to the intersection of finite family of fixed point sets of demimetric mappings such that its image under a finite number of linear transformations belongs to the intersection of another finite family of fixed point sets of demimetric mappings in the image space. Under suitable assumptions, the weak and strong convergence theorems are analysed. The obtained results generalize and improve the recent results announced by many other authors in the framework of split inverse problem. As a direct consequence of our two main algorithms, we obtain several new algorithms. Preliminary numerical experiments are provided to illustrate the efficiency and implementation of our new methods and also to compare with others. [ABSTRACT FROM AUTHOR]

We approximate the fixed point of the Suzuki's generalized nonexpansive mappings via the Picard-Ishikawa hyprid iterative process, recently introduced by Okeke [18]. We prove some weak and strong convergence theorems of this type of mappings in the setting of uniformly convex Banach spaces. We apply our results in finding the solution of a mixed type Volterra-Fredholm functional nonlinear integral equation in Banach spaces. Finally, we give several numerical examples to validate our analytical results. Our results extend and improve several known results in literature, including the results of Okeke [18], Ullah and Arshad [30] and Craciun and Serban [7] among others. [ABSTRACT FROM AUTHOR]

In this paper, we alter Wang's new iterative method as well as apply it to find the common solution of fixed point problem (FPP) and split variational inclusion problem ( S p VIP) in Hilbert space. We discuss the weak convergence for ( S p VIP) and strong convergence for the common solution of ( S p VIP) and (FPP) using appropriate assumptions. Some consequences of the proposed methods are studied. We compare our iterative schemes with other existing related schemes. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the notion of ϕ -nonexpansive sequences and maps in a Banach space E, and prove an ergodic theorem, a fixed point theorem, and some weak and strong convergence theorems for such sequences and maps in E, with rather mild assumptions on the Banach space E, weaker than those assumed by previous authors for nonexpansive maps. These results give a partial answer to the still open problem raised in 1981 by Djafari Rouhani for nonexpansive sequences in a Banach space. [ABSTRACT FROM AUTHOR]

In the settings of real Hilbert spaces, this paper proposes modified forward– backward scheme with inertial extrapolation step for solving inverse problems. In our proposed method, it is possible for the inertial factor to be chosen as 1 unlike many previous inertial forward–backward splitting methods available in the literature. Weak and strong convergence of our proposed method are obtained under some standard conditions. In order to show the numerical advantage gained when the inertial factor is chosen as 1, a number of numerical implementations are performed on two different inverse problems: LASSO and SCAD penalty problems. [ABSTRACT FROM AUTHOR]

The aim of this paper is to propose two modified forward-backward splitting algorithms for zeros of the sum of a maximal monotone operator and a Bregman inverse strongly monotone operator in reflexive Banach spaces. We prove weak and strong convergence theorems of the generated sequences by the proposed methods under some suitable conditions. We apply our results to study the variational inequality problem and the equilibrium problem. Finally, a numerical example is given to illustrate the proposed methods. The results presented in this paper improve and generalize many known results in recent literature. [ABSTRACT FROM AUTHOR]

In this paper, we present a concept of semigroups of enriched Kannan mappings, which is based on enriching contractive type mappings that have been effectively used in many recent studies. We investigate some weak and strong convergence theorems for the Mann iterative process to approximate common fixed points of enriched Kannan semigroups in uniformly convex Banach spaces. In the end, by using MATLAB, we present a numerical example to support our results. [ABSTRACT FROM AUTHOR]

We perform a numerical analysis of a class of randomly perturbed Hamiltonian systems and Poisson systems. For the considered additive noise perturbation of such systems, we show the long-time behaviour of the energy and quadratic Casimirs for the exact solution. We then propose and analyse a drift-preserving splitting scheme for such problems with the following properties: exact drift preservation of energy and quadratic Casimirs, mean-square order of convergence 1, weak order of convergence 2. These properties are illustrated with numerical experiments. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new iteration process which is faster than the leading; S [J. Nonlinear Convex Anal. 8, no. 1 (2007), 61{79], Thakur et al. [App. Math. Comp. 275 (2016), 147{155] and M [Filomat 32, no. 1 (2018), 187{196] iterations for numerical reckoning fixed points. Using this new iteration process, some fixed point convergence results for generalized ff-nonexpansive mappings in the setting of uniformly convex Banach spaces are proved. At the end of paper, we offer a numerical example to compare the rate of convergence of the proposed iteration process with the leading iteration processes. [ABSTRACT FROM AUTHOR]

Let C be a nonempty subset of a Banach space X. A mapping T: C → C is said to satisfy(Bγ,μ) condition if there exists γ ∈ [0,1] and μ ∈ [0, ½] satisfying 2μ ≤ γ such that for each x,y ∈ C, γ||x-Tx||≤||x-y||+μ||y-Ty|| implies ||Tx-Ty||≤(1-γ)||x-y||+μ(||x-Ty||+||y-Tx||). In this paper, we obtain some convergence theorems for such mappings using M iterative process in uniformly convex Banach space setting. Our results extend and improve many results in the literature. [ABSTRACT FROM AUTHOR]

We propose and study new projection-type algorithms for solving pseudomonotone variational inequality problems in real Hilbert spaces without assuming Lipschitz continuity of the cost operators. We prove weak and strong convergence theorems for the sequences generated by these new methods. The numerical behavior of the proposed algorithms when applied to several test problems is compared with that of several previously known algorithms. [ABSTRACT FROM AUTHOR]

A novel iterative algorithm is introduced for solving the split common fixed point problem with demicontractive operators. Weak and strong convergence of the algorithm is discussed. The step-sizes of the algorithm are chosen in such a way that the implementation of the algorithm does not depend on operator norms. The main results proven in this paper extend and improve some results of Yao et al. [Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem. Fixed Point Theor Appl. 2014;2014:183], Boikanyo [A strongly convergent algorithm for the split common fixed point problem. Appl Math Comput. 2015;265:844–853] and Cui and Wang [Iterative methods for the split common fixed point problem in Hilbert spaces. Fixed Point Theor Appl. 2014;2014:78]. [ABSTRACT FROM AUTHOR]

Two new iterative algorithms are introduced for solving the split common null point problem (SCNPP). The first algorithm is shown to converge weakly and the second is shown to converge strongly to a solution of SCNPP in a Hilbert space. The algorithms are forward methods (i.e, involving no computation of the resolvent of a monotone operator). Another feature of the algorithms is that the selection of the step-sizes does not need prior knowledge of operator norms. Numerical experiments are presented to illustrate the performance of the algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we study the iterations of strongly (asymptotic) quasi ø-nonexpansive mappings in Banach spaces. First, we prove weak convergence of the generated sequence to a common fixed point of an infinite family of strongly asymptotic quasi ø-nonexpansive mappings. Next we prove strong convergence of the generated sequence by an additional assumption. In the sequel, invoke of Halpern regularization method, we prove strong convergence of the generated sequence to a common fixed point of the family of mappings without any extra conditions. Finally, we give some applications of our main results in convex minimization and equilibrium problems and present numerical examples to illustrate and support them. [ABSTRACT FROM AUTHOR]

We present two projection extragradient algorithms for solving equilibrium problems without monotonicity and Lipschitz-type property in Hilbert spaces. Our strategy consists in embedding a subgradient projection step in the extragradient algorithm and employing an Armijo-linesearch. The strategy guarantees that the sequences generated by the presented algorithms converge weakly and strongly to a solution of the equilibrium problem, respectively. The convergence does not require any monotonicity and Lipschitz-type property of the bifunction but the nonemptyness of the solution set of the associated Minty equilibrium problem. Some numerical experiments illustrate the efficiency of the proposed algorithms. [ABSTRACT FROM AUTHOR]

Representation formulas for faces and support functions of the values of maximal monotone operators are established in two cases: either the operators are defined on reflexive and locally uniformly convex real Banach spaces with locally uniformly convex duals, or their domains have nonempty interiors on real Banach spaces. Faces and support functions are characterized by the limit values of the minimal-norm selections of maximal monotone operators in the first case while in the second case they are represented by the limit values of any selection of maximal monotone operators. These obtained formulas are applied to study the structure of maximal monotone operators: the local unique determination from their minimal-norm selections, the local and global decompositions, and the unique determination on dense subsets of their domains. [ABSTRACT FROM AUTHOR]

The paper deals with numerical discretizations of separable nonlinear Hamiltonian systems with additive noise. For such problems, the expected value of the total energy, along the exact solution, drifts linearly with time. We present and analyze a time integrator having the same property for all times. Furthermore, strong and weak convergence of the numerical scheme along with efficient multilevel Monte Carlo estimators are studied. Finally, extensive numerical experiments illustrate the performance of the proposed numerical scheme. [ABSTRACT FROM AUTHOR]

In this paper, we study to approximate solutions of quasi-equilibrium problems in Banach spaces, which generalizes equilibrium problems and quasi-variational inequalities. In fact, we prove weak convergence of the sequence generated by the proximal point method to a solution of the quasi-equilibrium problem. Then we show that the generated sequence converges strongly to a solution of the quasi-equilibrium problem. [ABSTRACT FROM AUTHOR]

In this paper, we propose a CQ-type algorithm for solving the split feasibility problem (SFP) in real Hilbert spaces. The algorithm is designed such that the step-sizes are directly computed at each iteration. We will show that the sequence generated by the proposed algorithm converges in norm to the minimum-norm solution of the SFP under appropriate conditions. In addition, we give some numerical examples to verify the implementation of our method. Our result improves and complements many known related results in the literature. [ABSTRACT FROM AUTHOR]

We develop and analyze a numerical method for stochastic time-fractional diffusion driven by additive fractionally integrated Gaussian noise. The model involves two nonlocal terms in time, i.e., a Caputo fractional derivative of order α ∈ (0,1), and fractionally integrated Gaussian noise (with a Riemann-Liouville fractional integral of order γ ∈ [0,1] in the front). The numerical scheme approximates the model in space by the standard Galerkin method with continuous piecewise linear finite elements and in time by the classical Grünwald-Letnikov method (for both Caputo fractional derivative and Riemann-Liouville fractional integral), and the noise by the L2-projection. Sharp strong and weak convergence rates are established, using suitable nonsmooth data error estimates for the discrete solution operators for the deterministic inhomogeneous problem. One- and two-dimensional numerical results are presented to support the theoretical findings. [ABSTRACT FROM AUTHOR]

We consider the time-fractional nonlinear stochastic fourth-order reaction diffusion equation driven by the fractional noise (FSRDE). The FSRDE is discretized by using the mixed finite element method in space and the FBT- θ method in time. Some good techniques are proposed to prove the important lemmas in the proof of the strong convergence and the weak convergence. By proving the error estimates on the strong and weak convergence, we find the strong convergence and the weak convergence have the same convergence rate, and the convergence order is related to the fractional noise derivative β but not to the time fractional derivative α and the discrete format coefficient θ. Finally, the theorems on the strong and weak convergence are verified by the numerical tests. [ABSTRACT FROM AUTHOR]

It is shown that in general the popular coefficient alpha estimator for reliability of multi-component measuring instruments converges almost surely to a quantity that is not equal to the population reliability coefficient. This convergence with probability 1 is a stronger statement than convergence in probability (consistency) and convergence in distribution for the alpha estimator, which have been studied in the past. In the special case of congeneric measures with uncorrelated errors and equal loadings on the common true score, the alpha estimator converges almost surely to the population reliability coefficient that equals population alpha, which implies also its consistency as a reliability estimator. When the loadings are unequal but sufficiently high and similar, the alpha estimator converges almost surely to population alpha that is essentially indistinguishable from the population reliability coefficient, which implies alpha's approximate consistency then. For the general case, the results entail that the alpha estimator is not a consistent estimator of reliability. The findings add to the critical literature on coefficient alpha in the general case, as well as to the justification of its use as a dependable measuring instrument reliability estimator in special cases and settings resulting under appropriate restrictive conditions, and are illustrated using a numerical example. [ABSTRACT FROM AUTHOR]

In this paper, we consider the averaging principle for one dimensional stochastic Burgers equation with slow and fast time-scales. Under some suitable conditions, we show that the slow component strongly converges to the solution of the corresponding averaged equation. Meanwhile, when there is no noise in the slow component equation, we also prove that the slow component weakly converges to the solution of the corresponding averaged equation with the order of convergence 1 − r , for any 0 < r < 1 . [ABSTRACT FROM AUTHOR]

In this paper, we present two penalty-splitting inspired iteration schemes (PFFSA) and (PFFSA) for hierarchical equilibrium problems in Hilbert space. Based on the Opial-Passty lemma, we propose weak ergodic convergence and weak convergence of the iterative sequences generated by the Forward-Forward algorithm (PFFSA) and the Forward-Backward algorithm (PFFSA), which are proved under quite mild conditions: the bifunction of the two level equilibrium problems are supposed pseudomonotone. For strong convergence, we first add a strong monotonicity condition on the objective bifunction. We present after, a strong convergence result of algorithm (PFFSA) by adding a topological assumption, i.e. the objective bifunction is of class . Some examples are given to illustrate our results. The first example deals with pseudomonotone variational inequalities and convex minimization problem in the upper level problem. In the second one, we propose a convex minimization in the lower-level problem, where strong convergence of (PFFSA) to a minimum point is insured under infcompactness condition for objective function. These convergence results are new and generalize some recent results in this field. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new class of nonlinear multi-valued mappings which is called a nonspreading-type mapping in Hilbert spaces, and prove some properties and the existence results for the proposed mapping. Furthermore, we prove weak and strong convergence theorems for a finite family of nonspreading-type multi-valued mappings in Hilbert spaces. As applications, we give examples and numerical results to illustrate our iteration and results. [ABSTRACT FROM AUTHOR]

Combining inertial-type methods with projection extragradient methods, we propose three inertial extragradient algorithms for solving nonmonotone and non-Lipschitzian equilibrium problems in Hilbert spaces. Under the assumption that the solution set of the associated Minty equilibrium problem is nonempty, we establish the weak and strong convergence of the proposed algorithms, respectively. The convergence is guaranteed without any monotonicity and Lipschitz-type continuity of the equilibrium bifunction. Some numerical experiments illustrate that the presented algorithms are faster than the existing projection extragradient ones. [ABSTRACT FROM AUTHOR]

In this paper we propose a new iteration process, called the K * iteration process, for approximation of fixed points. We show that our iteration process is faster than the existing well-known iteration processes using numerical examples. Stability of the K * iteration process is also discussed. Finally we prove some weak and strong convergence theorems for Suzuki generalized nonexpansive mappings in the setting of uniformly convex Banach spaces. Our results are the extension, improvement and generalization of many well-known results in the literature of iterations in fixed point theory. [ABSTRACT FROM AUTHOR]

In this article, we consider a split monotone variational inclusions constraints over the set of fixed points of finite families of firmly non-expansive mappings, named split hierarchical monotone variational inclusions problem (in short: SHMVIP). We propose an iterative algorithm for solving SHMVIP. Further, we prove that the sequence generated by proposed algorithm converges weakly to the solution of SHMVIP. Strong convergence of the iterative algorithm is also discussed under some suitable assumptions. We give an example in support of our problem. [ABSTRACT FROM AUTHOR]

We construct a family of processes, from a single Poisson process, that converges in law to a complex Brownian motion. Moreover, we find realizations of these processes that converge almost surely to the complex Brownian motion, uniformly on the unit time interval. Finally the rate of convergence is derived. [ABSTRACT FROM AUTHOR]

We consider a finite element approximation of a general semi-linear stochastic partial differential equation (SPDE) driven by space-time multiplicative and additive noise. We examine the full weak convergence rate of the exponential Euler scheme when the linear operator is self adjoint and also provide the full weak convergence rate for non-self-adjoint linear operator with additive noise. Key part of the proof does not rely on Malliavin calculus. For non-self-adjoint operators, we analyse the optimal strong error for spatially semi-discrete approximations for both multiplicative and additive noise with truncated and non-truncated noise. Depending on the regularity of the noise and the initial solution, we found that in some cases the rate of weak convergence is twice the rate of the strong convergence. Our convergence rate is in agreement with some numerical results in two dimensions. [ABSTRACT FROM AUTHOR]

In this paper, we consider the split feasibility problem (SFP) in infinite-dimensional Hilbert spaces and propose some subgradient extragradient-type algorithms for finding a common element of the fixed-point set of a strict pseudocontraction mapping and the solution set of a split feasibility problem by adopting Armijo-like stepsize rule. We derive convergence results under mild assumptions. Our results improve some known results from the literature. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

In this article, we prove several new ergodic, weak, and strong convergence theorems for solutions to the following general second-order difference equationwhereAis a maximal monotone operator in a real Hilbert spaceHand {cn} and {θn} are positive real sequences. We do not assumeA−1(0) ≠ ∅, and we prove among other things that the existence of solutions is in fact equivalent to the zero set ofAbeing nonempty. These theorems provide new approximation results for zeroes of monotone operators, as well as significantly unify and extend previously known results by assuming much weaker conditions on the coefficients {cn} and {θn}. [ABSTRACT FROM AUTHOR]

Let H be a Hilbert space and let C be a closed convex nonempty subset of H and $$T : C\rightarrow H$$ a non-self nonexpansive mapping. A map $$h : C\rightarrow R$$ defined by $$h(x) := \inf \{\lambda \ge 0 : \lambda x+(1-\lambda )Tx \in C \}$$ . Then, for a fixed $$x_0 \in C$$ and for $$\begin{aligned}{\alpha _0} = \max \left\{ {\frac{1}{2},h({x_0})} \right\}\end{aligned}$$ , Krasnoselskii-Mann algorithm is defined by $$x_{n+1}=\alpha _n+(1-\alpha _n)Tx_n,$$ where $$\alpha _{n+1}=\max \{\alpha _n, h(x_{x_{n+1}})\}$$ . Recently, Colao and Marino (Fixed Point Theory Appl 2015:39, 2015) have proved both weak and strong convergence theorems when C is a strictly convex set and T is an inward mapping. Meanwhile, they proposed a open question for a countable family of non-self nonexpansive mappings. In this article, authors will give an answer and will prove the further generalized results with the examples to support them. [ABSTRACT FROM AUTHOR]

In this paper, first we study the weak convergence of the proximal point algorithm for an infinite family of equilibrium problems of pseudo-monotone type in Hilbert spaces. Then with additional conditions on the bifunctions, we prove the strong convergence for the family to a common equilibrium point. We also study a regularization of Halpern type and prove the strong convergence of the generated sequence to an equilibrium point of the family of infinite pseudo-monotone bifunctions without any additional assumptions on the bifunctions. A concrete example of a family of pseudo-monotone bifunctions is also presented. [ABSTRACT FROM PUBLISHER]

In this paper, we study the weak and strong convergence of the proximal point algorithm for equilibrium problems of pseudo-monotone type in Hilbert spaces. We prove the weak convergence of the generated sequence to a common solution of two equilibrium problems and some strong convergence results with additional assumptions on pseudo-monotone bifunctions. Then we study a regularization of Halpern-type and prove the strong convergence of the generated sequence to an equilibrium point of two pseudo-monotone bifunctions without any additional assumption on bifunctions. Finally, some examples of pseudo-monotone bifunctions from pseudo-monotone operators and Nash-Cournot oligopolistic equilibrium models are also presented. Our results extend some similar results in the literature for monotone and pseudo-monotone equilibrium problems and also the related results for variational inequalities associated with monotone and pseudo-monotone operators. [ABSTRACT FROM AUTHOR]

In this paper, we consider the approximations of an iterative process for asymptotically k-strict pseudocontractive mappings in Hilbert spaces. Finally, we present some examples to study the rate of convergence. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to study modified two-step iteration process for a pair of quasi-nonexpansive mapping and asymptotically quasi-nonexpansive mapping in the intermediate sense. We also establish some strong convergence theorems and a weak convergence theorem for this iteration scheme and mappings in the framework of real Banach spaces. The results presented in this paper extend, improve and generalize some previous results from the existing literature (see for example [1, 3, 5-7, 9-13]). [ABSTRACT FROM AUTHOR]

The aim of this paper is to prove strong convergence theorem by a modified three step iterative process with errors for three nonexpansive mappings in the frame work of uniformly smooth Banach spaces. The main feature of this scheme is that its special cases can handle both strong convergence like Halpern type and weak convergence like Ishikawa type iteration schemes. Our result extend and generalize the result of S. H. Khan [10], Kim and Xu [12] and many other authors. [ABSTRACT FROM AUTHOR]

Letbe a real Hilbert space,a closed convex subset of,andcontinuous convex and bounded from below on. We study the asymptotic behaviour of the non-autonomous differential inclusion with project operator as followswhereis an absolutely continuous decreasing control function with strictly positive value and. On the one hand, when, each solution of PS with initial point(not necessarily in) converges to an element ofin the weak topology. On the other hand, whenand, the weak and strong convergence of PS to the minimizer ofovercan be guaranteed under some conditions. Strong convergence can be obtained whenoris strongly convex on. Another two sufficient conditions are given to ensure the weak convergence. Moreover, asymptotic analysis for the special case thatis also considered. Finally, we present some discussion on the global existence of the solutions of PS. [ABSTRACT FROM PUBLISHER]

We prove several new weak and strong ergodic theorems, as well as weak and strong convergence theorems for solutions to the following second order difference equation:whereAis a maximal monotone operator in a real Hilbert spaceH, and {cn} is a positive sequence of real numbers. We do not assume thatA−1(0) ≠ ∅, and we prove among other things that the existence of solutions is in fact equivalent to the zero set ofAbeing nonempty. These theorems provide new approximation results for zeros of monotone operators, as well as unify and extend previously known results in [2, 3, 7, 10, 18, 22, 23, 25] by considering much weaker conditions on the coefficients {cn}. In particular, our new strong ergodic theorem extends the results of [7] and [23, Theorem 3.3] for first-order difference equations, to the case of second order difference equations, and implies also a new strong convergence theorem. [ABSTRACT FROM PUBLISHER]