相关论文: A Simple proof for Imnang's algorithms

In this paper, we introduce an iterative process which converges strongly to a common element of sets of solutions of finite family of generalized equilibrium problems, sets of fixed points of finite family of continuous relatively…

The image restoration problem is one of the popular topics in image processing studied by many authors on account of its applications in various areas. The aim of this paper is to present a new algorithm by using viscosity approximation…

In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…

In this paper, we study a new iterative method for finding the fixed point of a weak Bregman relatively nonexpansive mapping and the set of solutions of generalized mixed equilibrium problems in Banach spaces.

Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…

In this paper, using generalized metric projection, we propose a new extragradient method for finding a common element of the solutions set of a generalized equilibrium problem and a variational inequality for an $\alpha$-inverse-strongly…

By using the Ishikawa iterative algorithm, we approximate the fixed points and the best proximity points of a relatively non expansive mapping. Also, we use the von Neumann sequence to prove the convergence result in a Hilbert space…

In this paper, we introduce a new modified Ishikawa iteration for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of relatively nonexpansive mappings in a Banach space. Our results…

We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…

We study the approximation of fixed points of nonexpansive mappings in CAT(k) spaces. We show that the iterative sequence generated by the Moudafi's viscosity type algorithm converges to one of the fixed points of the nonexpansive mapping…

We propose and analyze a multi-inertial-iteration scheme in cone b, p-normed Banach spaces. This framework extends the classical Krasnoselskii-Mann and two-step inertial iterations by incorporating three independent inertial parameters and…

In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone…

In this article a unified approach to iterative soft-thresholding algorithms for the solution of linear operator equations in infinite dimensional Hilbert spaces is presented. We formulate the algorithm in the framework of generalized…

The convergence of the algorithm for solving convex feasibility problem is studied by the method of sequential averaged and relaxed projections. Some results of H. H. Bauschke and J. M. Borwein are generalized by introducing new methods.…

In this paper, we introduced a three-step iterative process with errors for three multivalued mappings satisfying the condition (C) in uniformly convex Banach spaces and establish strong convergence theorems for the proposed process under…

In this paper, the local convergence of Iteratively regularized Landweber iteration method is investigated for solving non-linear inverse problems in Banach spaces. Our analysis mainly relies on the assumption that the inverse mapping…

In his recent research M. K. Tam (2018) considered a framework for the analysis of iterative algorithms which can be described in terms of a structured set-valued operator. At each point in the ambient space, the value of the operator can…

In this paper we propose a unified way of analyzing a certain kind of greedy-type algorithms in Banach spaces. We define a class of the Weak Biorthogonal Greedy Algorithms that contains a wide range of greedy algorithms. In particular, we…

We combine two iterative algorithms for solving large-scale systems of linear inequalities, the relaxation method of Agmon, Motzkin et al. and the randomized Kaczmarz method. In doing so, we obtain a family of algorithms that generalize and…

This paper is concerned with the study of a family of fixed point iterations combining relaxation with different inertial (acceleration) principles. We provide a systematic, unified and insightful analysis of the hypotheses that ensure…