Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
نویسندگان
چکیده
منابع مشابه
Perturbed Projections and Subgradient Projections for the Multiple-Sets Split Feasibility Problem
We study the multiple-sets split feasibility problem that requires to find a point closest 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. By casting the problem into an equivalent problem in a suitable product space we are able to present a simultaneous subgradients proj...
متن کاملOn The Behavior of Subgradient Projections Methods for Convex Feasibility Problems
We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation parameters in a specific self-adapting manner. This strategy that controls the relaxation parameters in a specific manner leaves enough user-flexibility but giv...
متن کاملOn The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation parameters in a specific self-adapting manner. This strategy leaves enough user-flexibility but gives a mathematical guarantee for the algorithm's behavior in t...
متن کاملZero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
The convex feasibility problem (CFP) is at the core of the modeling of many problems in various areas of science. Subgradient projection methods are important tools for solving the CFP because they enable the use of subgradient calculations instead of orthogonal projections onto the individual sets of the problem. Working in a real Hilbert space, we show that the sequential subgradient projecti...
متن کاملSome Explicit and Hybrid Strong Convergence Algorithms for Solving the Multiple-Sets Split Feasibility Problem
In this paper, we present several explicit and hybrid strong convergence algorithms for solving the multiple-sets split feasibility problem (MSSFP). Firstly, we modify the existing successive, parallel and cyclic algorithms with the hybrid steepest descent method; then two new hybrid formulas based on the Mann type method are presented; Two general hybrid algorithms which can cover the former o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2007
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2006.05.010