scispace - formally typeset
Journal ArticleDOI

A strong convergence algorithm for a fixed point constrained split null point problem

TLDR
In this article, a self-adaptive step-size method for finding a common solution of a split feasibility problem and a fixed point problem in real Hilbert spaces is proposed. But the authors do not consider the operator norm in the proposed method.
Abstract
In this paper, we introduce a new algorithm with self adaptive step-size for finding a common solution of a split feasibility problem and a fixed point problem in real Hilbert spaces. Motivated by the self adaptive step-size method, we incorporate the self adaptive step-size to overcome the difficulty of having to compute the operator norm in the proposed method. Under standard and mild assumption on the control sequences, we establish the strong convergence of the algorithm, obtain a common element in the solution set of a split feasibility problem for sum of two monotone operators and fixed point problem of a demimetric mapping. Numerical examples are presented to illustrate the performance and the behavior of our method. Our result extends, improves and unifies other results in the literature.

read more

Citations
More filters
Journal ArticleDOI

On split feasibility problem for finite families of equilibrium and fixed point problems in Banach spaces

TL;DR: In this article , a hybrid extragradient iterative algorithm that employs a Bregman distance approach for approximating a split feasibility problem for a finite family of equilibrium problems involving pseudomonotone bifunctions and fixed point problems for Bregmann quasi-asymptotically nonexpansive mappings was introduced.
References
More filters
Journal ArticleDOI

On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators

TL;DR: This paper shows, by means of an operator called asplitting operator, that the Douglas—Rachford splitting method for finding a zero of the sum of two monotone operators is a special case of the proximal point algorithm, which allows the unification and generalization of a variety of convex programming algorithms.
Journal ArticleDOI

Iterative Algorithms for Nonlinear Operators

TL;DR: In this paper, a modification of Rockafellar's proximal point algorithm is obtained and proved to be always strongly convergent, and the ideas of these algorithms are applied to solve a quadratic minimization problem.
Journal ArticleDOI

A multiprojection algorithm using Bregman projections in a product space

TL;DR: Using an extension of Pierra's product space formalism, it is shown here that a multiprojection algorithm converges and is fully simultaneous, i.e., it uses in each iterative stepall sets of the convex feasibility problem.
Journal ArticleDOI

Construction of fixed points of nonlinear mappings in Hilbert space

TL;DR: In this paper, the existence of fixed points of non-compact mappings of a subset C of a Hilbert space H of a function space into H has been studied under a number of topological arguments.
Related Papers (5)