Search

Enriched multi-valued contraction mappings and enriched multi-valued nonexpansive mappings are introduced in the context of geodesic spaces, and their fixed points are analyzed in CAT(0) spaces. For the contraction mapping, the existence of a fixed point is established, and a scheme for approximating the point is provided. Conditions under which a sequence converges to a fixed point of the enriched multi-valued nonexpansive mapping are given, and the mapping is shown to exhibit a demiclosedness-type property. Furthermore, it is shown that the fixed point set of the mapping is closed and convex. Conditions under which a sequence converges to a Mann-type scheme are given, and an application to an equilibrium problem involving Nash non-cooperative games is discussed. [ABSTRACT FROM AUTHOR]

This paper provides an iterative construction for a common solution associated with the pseudomonotone equilibrium problems, fixed point problem of a finite family η -demimetric operators and the generalized split null point problem in Hilbert spaces. The sequence of approximants is a variant of the parallel shrinking extragradient algorithm with the inertial effect converging strongly to the optimal common solution under suitable set of control conditions. The viability of the approximants is demonstrated for various theoretical as well as numerical results. The results presented in this paper improve various existing results in the current literature. [ABSTRACT FROM AUTHOR]

In this work, we propose an iterative method for finding a common solution of a variational inclusion problem involving a maximally monotone operator and a fixed point problem for a pseudocontractive mapping in real Hilbert space. Under some standard and easy-to-verify conditions, we establish that the sequence generated by the proposed method converges strongly to a solution of the considered problem. Numerical illustrations and application in image recovery suggest that the proposed method is easy to implement and efficient. [ABSTRACT FROM AUTHOR]

This paper provides convergence analysis of some variants of the hybrid extragradient algorithm (HEA) in Hilbert spaces. We employ the HEA to compute the common solution of the equilibrium problem and split fixed-point problem associated with the finite families of k -demicontractive mappings. We also incorporate appropriate numerical results concerning the viability of the proposed variants with respect to various real-world applications. [ABSTRACT FROM AUTHOR]

In this paper, a Halpern–Tseng-type algorithm for approximating zeros of the sum of two monotone operators whose zeros are J-fixed points of relatively J-nonexpansive mappings is introduced and studied. A strong convergence theorem is established in Banach spaces that are uniformly smooth and 2-uniformly convex. Furthermore, applications of the theorem to convex minimization and image-restoration problems are presented. In addition, the proposed algorithm is used in solving some classical image-recovery problems and a numerical example in a Banach space is presented to support the main theorem. Finally, the performance of the proposed algorithm is compared with that of some existing algorithms in the literature. [ABSTRACT FROM AUTHOR]

A family of inertial extragradient-type algorithms is proposed for solving convex pseudomonotone variational inequality with fixed-point problems, where the involved mapping for the fixed point is a ρ-demicontractive mapping. Under standard hypotheses, the generated iterative sequence achieves strong convergence to the common solution of the variational inequality and fixed-point problem. Some special cases and sufficient conditions that guarantee the validity of the hypotheses of the convergence statements are also discussed. Numerical applications in detail illustrate the theoretical results and comparison with existing methods. [ABSTRACT FROM AUTHOR]

In this article, we propose a hybrid iterative scheme with strong convergence property for solving variational inequality problems. The algorithm uses a self-adaptive stepsize defined using a simple updating rule. Therefore, the method does not require prior knowledge of the Lipschitz constant of the underlying operator. We consider a more general set of operators as the underlying operators. Moreover, we derived a fixed stepsize scheme from the proposed method. Under some suitable conditions, we show the strong convergence of the iterates generated by the proposed and the derived algorithms. Furthermore, we present numerical experiments to illustrate the computational performance of the proposed algorithm in comparison with some of the existing algorithms in the literature. Additionally, as an application, we use the proposed algorithm to solve the problem of recovering an original signal from a noisy signal [ABSTRACT FROM AUTHOR]

This paper provides iterative construction of a common solution associated with a class of equilibrium problems and split convex feasibility problems. In particular, we are interested in the equilibrium problems defined with respect to the pseudomonotone and Lipschitz-type continuous equilibrium problem together with the generalized split null point problems in real Hilbert spaces. We propose an iterative algorithm that combines the hybrid extragradient method with the inertial acceleration method. The analysis of the proposed algorithm comprises theoretical results concerning strong convergence under suitable set of constraints and numerical results concerning the viability of the proposed algorithm with respect to various real-world applications. [ABSTRACT FROM AUTHOR]

In this paper we suggest a theoretical framework to study the generalized split null point problem (GSNPP) via a multi-step inertial based parallel hybrid projection algorithm in Hilbert spaces. The architecture and the suitable set of control conditions ensure the strong convergence of the algorithm. The possible applications of the algorithm are illustrated via various theoretical and numerical results. The key advantages of the algorithm are highlighted in comparison to the classical and non-inertial algorithm as well as (one-step and two-step) inertial variants of the algorithm for the GSNPP. [ABSTRACT FROM AUTHOR]

In this paper, we introduce an inertial Halpern-type iterative algorithm for approximating a zero of the sum of two monotone operators in the setting of real Banach spaces that are 2-uniformly convex and uniformly smooth. Strong convergence of the sequence generated by our proposed algorithm is established by means of some new geometric inequalities proved in this paper that are of independent interest. Furthermore, numerical simulations in image restoration and compressed sensing problems are also presented. Finally, the performance of the proposed method is compared with that of some existing methods in the literature. [ABSTRACT FROM AUTHOR]

In this paper, we compute a common solution of the fixed point problem (FPP) and the generalized split common null point problem (GSCNPP) via the inertial hybrid shrinking approximants in Hilbert spaces. We show that the approximants can be easily adapted to various extensively analyzed theoretical problems in this framework. Finally, we furnish a numerical experiment to analyze the viability of the approximants in comparison with the results presented in (Reich and Tuyen in Rev. R. Acad. Cienc. Exactas Fís. Nat., Ser. A Mat. 114:180, 2020). [ABSTRACT FROM AUTHOR]

The main purpose of this paper is to introduce a new iterative algorithm to solve inclusion problems in Hadamard manifolds. Moreover, applications to convex minimization problems and variational inequality problems are studied. A numerical example also is presented to support our main theorem. [ABSTRACT FROM AUTHOR]

He (J. Inequal. Appl. 2012:Article ID 162 2012) introduced the proximal point CQ algorithm (PPCQ) for solving the split equilibrium problem (SEP). However, the PPCQ converges weakly to a solution of the SEP and is restricted to monotone bifunctions. In addition, the step-size used in the PPCQ is a fixed constant μ in the interval (0 , 1 ∥ A ∥ 2) . This often leads to excessive numerical computation in each iteration, which may affect the applicability of the PPCQ. In order to overcome these intrinsic drawbacks, we propose a robust step-size { μ n } n = 1 ∞ which does not require computation of ∥ A ∥ and apply the adaptive step-size rule on { μ n } n = 1 ∞ in such a way that it adjusts itself in accordance with the movement of associated components of the algorithm in each iteration. Then, we introduce a self-adaptive extragradient-CQ algorithm (SECQ) for solving the SEP and prove that our proposed SECQ converges strongly to a solution of the SEP with more general pseudomonotone equilibrium bifunctions. Finally, we present a preliminary numerical test to demonstrate that our SECQ outperforms the PPCQ. [ABSTRACT FROM AUTHOR]

This paper provides iterative construction of a common solution associated with the classes of equilibrium problems (EP) and split convex feasibility problems. In particular, we are interested in the EP defined with respect to the pseudomonotone bifunction, the fixed point problem (FPP) for a finite family of -demicontractive operators, and the split null point problem. From the numerical standpoint, combining various classical iterative algorithms to study two or more abstract problems is a fascinating field of research. We, therefore, propose an iterative algorithm that combines the parallel hybrid extragradient algorithm with the inertial extrapolation technique. The analysis of the proposed algorithm comprises theoretical results concerning strong convergence under a suitable set of constraints and numerical results. [ABSTRACT FROM AUTHOR]