Multiple-sets Split Feasibility Problem Research Articles

Strong and Weak Convergence Theorems for the Split Feasibility Problem of (β,k)-Enriched Strict Pseudocontractive Mappings with an Application in Hilbert Spaces

The concept of symmetry has played a major role in Hilbert space setting owing to the structure of a complete inner product space. Subsequently, different studies pertaining to symmetry, including symmetric operators, have investigated real Hilbert spaces. In this paper, we study the solutions to multiple-set split feasibility problems for a pair of finite families of β-enriched, strictly pseudocontractive mappings in the setup of a real Hilbert space. In view of this, we constructed an iterative scheme that properly included these two mappings into the formula. Under this iterative scheme, an appropriate condition for the existence of solutions and strong and weak convergent results are presented. No sum condition is imposed on the countably finite family of the iteration parameters in obtaining our results unlike for several other results in this direction. In addition, we prove that a slight modification of our iterative scheme could be applied in studying hierarchical variational inequality problems in a real Hilbert space. Our results improve, extend and generalize several results currently existing in the literature.

Inertial Halpern-type iterative algorithm for the generalized multiple-set split feasibility problem in Banach spaces

In this paper, we study the generalized multiple-set split feasibility problem including the common fixed-point problem for a finite family of generalized demimetric mappings and the monotone inclusion problem in 2-uniformly convex and uniformly smooth Banach spaces. We propose an inertial Halpern-type iterative algorithm for obtaining a solution of the problem and derive a strong convergence theorem for the algorithm. Then, we apply our convergence results to the convex minimization problem, the variational inequality problem, the multiple-set split feasibility problem and the split common null-point problem in Banach spaces.

Extended CQ algorithm integrated with selection technique for multiple-sets split feasibility problem

Extended CQ algorithm integrated with selection technique for multiple-sets split feasibility problem

The multiple-set split feasibility problem and its application in intensity-modulated radiation therapy

In this paper, we apply a parallel iterative method for solving the split common fixed point problem in Hilbert spaces, without prior knowledge of the transfer operator norm, to the multiple-set split feasibility problem, which plays an important role in medical image reconstruction and signal processing. By formulating a model of the intensity-modulated radiation therapy treatment in a mathematical framework based on the multiple-set split feasibility problem, we also offer an effective approach for solving the intensity-modulated radiation therapy treatment planning.

A hybrid projection method for solving the multiple-sets split feasibility problem

A hybrid projection method for solving the multiple-sets split feasibility problem

SOLVING MULTIPLE-SETS SPLIT MONOTONE VARIATIONAL INCLUSION PROBLEM IN REAL HILBERT SPACES.

In this paper, we study and introduce a self adaptive method to­gether with a Halpern iterative algorithm for approximating solutions of multiple-sets split monotone variational inclusion problem which in­cludes the multiple-sets split feasibility problem, split feasibility prob­lem, split monotone variational inclusion problem and split variational inclusion problem, to mention a few. Using our iterative algorithm, we prove a strong convergence result for approximating the solution of the aforementioned problems. Numerical examples on finite-dimensional and infinite-dimensional spaces are displayed to illustrate the perfor­mance of our iterative method. The result discussed in this article extends and complements many related results in literature.

A novel algorithm for approximating common solution of a system of monotone inclusion problems and common fixed point problem

<p style='text-indent:20px;'>In this paper, we study the problem of finding a common element of the set of solutions of a system of monotone inclusion problems and the set of common fixed points of a finite family of generalized demimetric mappings in Hilbert spaces. We propose a new and efficient algorithm for solving this problem. Our method relies on the inertial algorithm, Tseng's splitting algorithm and the viscosity algorithm. Strong convergence analysis of the proposed method is established under standard and mild conditions. As applications we use our algorithm for finding the common solutions to variational inequality problems, the constrained multiple-set split convex feasibility problem, the convex minimization problem and the common minimizer problem. Finally, we give some numerical results to show that our proposed algorithm is efficient and implementable from the numerical point of view.</p>

An extended inertial Halpern-type ball-relaxed CQ algorithm for multiple-sets split feasibility problem

An extended inertial Halpern-type ball-relaxed CQ algorithm for multiple-sets split feasibility problem

A new iterative method for solving the multiple-set split variational inequality problem in Hilbert spaces

This paper proposes a new self-adaptive algorithm for solving the multiple-set split variational inequality problem in Hilbert spaces. Our algorithm uses dynamic step-sizes, chosen based on information of the previous step. In comparison with the work by Censor et al. [Numer Algorithms. 2012;59:301–323], the new algorithm gives strong convergence results and does not require information about the transformation operator's norm. Some applications of our main results regarding the solution of the multiple-set split feasibility problem and the split feasibility problem are presented and show that the iterative method converges strongly under weaker assumptions than the ones used recently by Xu [Inverse Probl. 2006;22:2021–2034] and by Buong [Numer Algorithms. 2017;76:783–798]. Numerical experiments on finite-dimensional and infinite-dimensional spaces and an application to discrete optimal control problems are reported to demonstrate the advantages and efficiency of the proposed algorithms over some existing results.

Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee

Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee

A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem

A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem

Shrinking hybrid method for multiple-sets split feasibility problems and variational inequality problems

Shrinking hybrid method for multiple-sets split feasibility problems and variational inequality problems

The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem

The multiple-sets split feasibility problem is the generalization of split feasibility problem, which has been widely used in fuzzy image reconstruction and sparse signal processing systems. In this paper, we present an inertial relaxed algorithm to solve the multiple-sets split feasibility problem by using an alternating inertial step. The advantage of this algorithm is that the choice of stepsize is determined by Armijo-type line search, which avoids calculating the norms of operators. The weak convergence of the sequence obtained by our algorithm is proved under mild conditions. In addition, the numerical experiments are given to verify the convergence and validity of the algorithm.

Bounded Perturbation Resilience of Two Modified Relaxed CQ Algorithms for the Multiple-Sets Split Feasibility Problem

In this paper, we present some modified relaxed CQ algorithms with different kinds of step size and perturbation to solve the Multiple-sets Split Feasibility Problem (MSSFP). Under mild assumptions, we establish weak convergence and prove the bounded perturbation resilience of the proposed algorithms in Hilbert spaces. Treating appropriate inertial terms as bounded perturbations, we construct the inertial acceleration versions of the corresponding algorithms. Finally, for the LASSO problem and three experimental examples, numerical computations are given to demonstrate the efficiency of the proposed algorithms and the validity of the inertial perturbation.

Multiple-sets split feasibility problem and split equality fixed point problem for firmly quasi-nonexpansive or nonexpansive mappings

In this paper, we propose a new iterative algorithm for solving the multiple-sets split feasibility problem (MSSFP for short) and the split equality fixed point problem (SEFPP for short) with firmly quasi-nonexpansive operators or nonexpansive operators in real Hilbert spaces. Under mild conditions, we prove strong convergence theorems for the algorithm by using the projection method and the properties of projection operators. The result improves and extends the corresponding ones announced by some others in the earlier and recent literature.

Strong convergence theorem for common zero points of inverse strongly monotone mappings and common fixed points of generalized demimetric mappings

In this paper, we introduce a new and efficient algorithm for finding a common element of the set of common fixed points of a finite family of generalized demimetric mappings and the set of common zero points of a finite family of inverse strongly monotone mappings in Hilbert spaces. Strong convergence of the proposed algorithm is established under standard and mild conditions in a Hilbert space. As an application, we use our algorithm for solving the common solutions to the variational inequality problem, the common minimization problem, the multiple-set split feasibility problem, the split common fixed point problem and the split common null point problem.

Convergence Theorems for the Variational Inequality Problems and Split Feasibility Problems in Hilbert Spaces

In this paper, we establish an iterative algorithm by combining Yamada’s hybrid steepest descent method and Wang’s algorithm for finding the common solutions of variational inequality problems and split feasibility problems. The strong convergence of the sequence generated by our suggested iterative algorithm to such a common solution is proved in the setting of Hilbert spaces under some suitable assumptions imposed on the parameters. Moreover, we propose iterative algorithms for finding the common solutions of variational inequality problems and multiple-sets split feasibility problems. Finally, we also give numerical examples for illustrating our algorithms.

Ball-relaxed projection algorithms for multiple-sets split feasibility problem

ABSTRACT The multiple-sets split feasibility problem (MSSFP) requires finding a point closet to a family of closed convex sets in one space such that its image under a linear transformation will be closest to another family of closed convex sets in the image space. Motivated by the ball-relaxed projection algorithm proposed by Yu et al. for the split feasibility problem (SFP), in this paper, we introduce ball-relaxed projection algorithms for solving the MSSFP. Instead of the level sets or half-spaces, our algorithms require computing the orthogonal projections onto closed balls. We establish weak and strong convergence of the proposed algorithms to a solution of the MSSFP. Finally, we provide preliminary numerical experiments to show the efficiency and the implementation of our method.

A Strong Convergence Theorem for an Iterative Method for Solving the Split Variational Inequalities in Hilbert Spaces

There are many iterative methods for solving the split variational inequality problems involving step sizes that depend on the norm of a bounded linear operator $\mathcal F$ . We know that the implementation of such algorithms is usually difficult to handle, because we have to compute the norm of the operator $\mathcal F$ . In this paper, we introduce a new iterative algorithm for approximating a solution of a class of multiple-sets split variational inequality problems, without prior knowledge of operator norms. Strong convergence of the iterative process is proved. As an application, we obtain a strong convergence result for a class of multiple-sets split feasibility problem. Two numerical examples are given to illustrate the proposed iterative algorithm.

A New Iterative Algorithm for the Multiple-Sets Split Feasibility Problem and the Split Equality Fixed Point Problem

In this paper, we propose a new iterative algorithm for solving the multiple-sets split feasibility problem and the split equality fixed point problem of firmly quasi-nonexpansive mappings in real Hilbert spaces. Under very mild conditions, we prove a weak convergence theorem for our algorithm using projection method and the properties of firmly quasi-nonexpansive mappings. Our result improves and extends the corresponding ones announced by some others in the earlier and recent literature.