TY - JOUR
T1 - An efficient simultaneous method for the constrained multiple-sets split feasibility problem
AU - Zhang, Wenxing
AU - Han, Deren
AU - Yuan, Xiaoming
N1 - Funding Information:
Acknowledgements The research of the second author is supported by the National Natural Science Foundation of China (NSFC) grants 11071122, 10871098, Natural Science Foundation (NSF) of Jiangsu Province at Grant No. BK2009397, and the Specialized Research Fund of Doctoral Program of Higher Education of China. The research of the third author is supported by the Hong Kong General Research Fund: HKBU 203009.
PY - 2012/7
Y1 - 2012/7
N2 - The multiple-sets split feasibility problem (MSFP) captures various applications arising in many areas. Recently, by introducing a function measuring the proximity to the involved sets, Censor et al. proposed to solve the MSFP via minimizing the proximity function, and they developed a class of simultaneous methods to solve the resulting constrained optimization model numerically. In this paper, by combining the ideas of the proximity function and the operator splitting methods, we propose an efficient simultaneous method for solving the constrained MSFP. The efficiency of the new method is illustrated by some numerical experiments.
AB - The multiple-sets split feasibility problem (MSFP) captures various applications arising in many areas. Recently, by introducing a function measuring the proximity to the involved sets, Censor et al. proposed to solve the MSFP via minimizing the proximity function, and they developed a class of simultaneous methods to solve the resulting constrained optimization model numerically. In this paper, by combining the ideas of the proximity function and the operator splitting methods, we propose an efficient simultaneous method for solving the constrained MSFP. The efficiency of the new method is illustrated by some numerical experiments.
KW - Convex feasibility problem
KW - Multiple-sets split feasibility problem
KW - Simultaneous method
UR - http://www.scopus.com/inward/record.url?scp=84865253650&partnerID=8YFLogxK
U2 - 10.1007/s10589-011-9429-8
DO - 10.1007/s10589-011-9429-8
M3 - Journal article
AN - SCOPUS:84865253650
SN - 0926-6003
VL - 52
SP - 825
EP - 843
JO - Computational Optimization and Applications
JF - Computational Optimization and Applications
IS - 3
ER -