A new relaxed method for the split feasibility problem in Hilbert spaces
Hai Yu, Fenghui Wang
Abstract
In this paper, we introduce a new relaxed method for solving the split feasibility problem in Hilbert spaces. In our method, the projection to the halfspace is replaced by the one to the intersection of two halfspaces. We give convergence of the sequence generated by our method under some suitable assumptions. Finally, we give a numerical example for illustrating the efficiency and implementation of our algorithms in comparison with existing algorithms in the literature.
Topics & Concepts
Hilbert spaceMathematicsIntersection (aeronautics)Sequence (biology)Convergence (economics)Projection methodProjection (relational algebra)Mathematical optimizationApplied mathematicsAlgorithmPure mathematicsDykstra's projection algorithmBiologyGeneticsAerospace engineeringEconomic growthEconomicsEngineeringOptimization and Variational AnalysisAdvanced Optimization Algorithms ResearchFixed Point Theorems Analysis