分裂可行性问题的超松弛投影算法及其强收敛性
Strong Convergence of Over Relaxation Projection Algorithms for Solving Split Feasibility Problems
DOI: 10.12677/PM.2023.139280, PDF,    国家社会科学基金支持
作者: 薛中会*, 陈 昱：上海出版印刷高等专科学校，信息与智能工程系，上海
关键词: 分裂可行性问题；投影算法；强收敛；Hilbert空间；Split Feasibility Problem； Projection Algorithm； Strong Convergence； Hilbert Spaces
摘要: 分裂可行性问题(Split feasibility problem, SFP)是寻找与非空闭凸集距离最近的点，并使得该点在线性变换下的像与另一非空闭凸集的距离最近。作为一类产生于工程实践的重要优化问题，在医学、信号处理和图像重建领域中被广泛应用。本文在Hilbert空间中，提出一种求解分裂可行性问题的超松弛投影算法。首先在CQ算法上引入改造的Halpern迭代序列和多个参数；然后在一定条件下，证明算法的强收敛性；数值实验结果验证了提出算法的有效性。
Abstract: The splitting feasible problem is to find the point closest to a non-empty closed convex set and make the image of the point under linear transformation closest to another non-empty closed convex set. Split feasible problem is an important optimization problem, arising from engineering practice, and is widely used in the fields of medicine, signal processing and image reconstruction. In this paper, an over-relaxed projection algorithm is presented for solving the split feasible problem in Hilbert space. Firstly, the modified Halpern iteration sequence and several parameters are introduced into the CQ algorithm. Then, under certain conditions, the strong convergence of the algorithm is proved. Finally, the numerical results show that the proposed algorithm is effective.
文章引用：薛中会, 陈昱. 分裂可行性问题的超松弛投影算法及其强收敛性[J]. 理论数学, 2023, 13(9): 2725-2736. https://doi.org/10.12677/PM.2023.139280

参考文献

[1] Censor, Y. and Elfving, T. (1994) A Multiprojection Algorithm Using Bregman Projections in a Product Space. Nu-merical Algorithms, 8, 221-239. [Google Scholar] [CrossRef] 
[2] Suantai, S., Kesornprom, S. and Cholamjiak, P. (2019) A New Hybrid CQ Algorithm for the Split Feasibility Problem in Hilbert Spaces and Its Appli-cations to Compressed Sensing. Mathematics, 7, Article No. 789. [Google Scholar] [CrossRef] 
[3] Ansari, Q.H., Rehan, A. and Yao, J.C. (2017) Split Feasibility and Fixed Point Problems for Asymptotically k-Strict Pseudo-Contractive Mappings in Intermediate Sense. Fixed Point Theory, 18, 57-68. [Google Scholar] [CrossRef] 
[4] Padcharoen, A., Kumam, P. and Cho, Y.J. (2018) Split Common Fixed Point Problems for Demicontractive Operators. Numerical Algorithms, 82, 297-320. [Google Scholar] [CrossRef] 
[5] Censor, Y., Bortfeld, T., Martin, B., et al. (2006) A Unified Ap-proach for Inversion Problems in Intensity-Modulated Radiation Therapy. Physics in Medicine and Biology, 51, 2353-2365. [Google Scholar] [CrossRef] [PubMed]
[6] Dang, Y.Z. and Gao, Y. (2011) The Strong Con-vergence of a KM-CQ-Like Algorithm for a Split Feasibility Problem. Inverse Problem, 27, Article ID: 015007. [Google Scholar] [CrossRef] 
[7] Byrne, C. (2002) Iterative Oblique Projection onto Convex Subsets and the Split Feasibility Problem. Inverse Problem, 18, 441-453. [Google Scholar] [CrossRef] 
[8] Vinh, N.T., Cholamjiak, P. and Suantai, S. (2018) A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces. Bulletin of the Malaysian Mathematical Sciences Society, 42, 2517-2534. [Google Scholar] [CrossRef] 
[9] Zhao, J., Zhang, Y. and Yang, Q. (2012) Modified Projection Methods for the Split Feasibility Problem and the Multiple-Sets Split Feasibility Problem. Applied Mathematics & Computation, 219, 1644-1653. [Google Scholar] [CrossRef] 
[10] Kesornprom, S., Pholasa, N. and Cholamjiak, P. (2020) On the Convergence Analysis of the Gradient-CQ Algorithms for the Split Feasibility Problem. Numerical Algorithms, 84, 997-1017. [Google Scholar] [CrossRef] 
[11] Pan, X., Kang, S.M. and Kwun, Y.C. (2014) Iterative Computation for Solving the Variational Inequality and the Generalized Equilibrium Problem. Journal of Applied Mathematics, 2014, Article ID: 478172. [Google Scholar] [CrossRef] 
[12] Wang, F. and Xu, H.K. (2010) Approximating Curve and Strong Con-vergence of the CQ Algorithm for the Split Feasibility Problem. Journal of Inequalities & Applications, 2010, Article ID: 102085. [Google Scholar] [CrossRef] 
[13] López, G., Martín-Márquez, V., Wang, F., et al. (2012) Solving the Split Feasibility Problem without Prior Knowledge of Matrix Norms. Inverse Problems, 28, 374-389. [Google Scholar] [CrossRef] 
[14] Halpern, B. (1967) Fixed Points of Nonexpanding Maps. Bulletin of the American Mathematical Society, 73, 957-961. [Google Scholar] [CrossRef] 
[15] Byrne, C. (2004) A Unified Treatment of Some Iterative Algorithms in Signal Processing and Image Reconstruction. Inverse Problems, 20, 103-120. [Google Scholar] [CrossRef] 
[16] Goebel, K. and Kirk, W.A. (1990) Topics in Metric Fixed Point Theory. Cambridge University Press, Cambridge. [Google Scholar] [CrossRef] 
[17] Martinez-Yanes, C. and Xu, H.K. (2006) Strong Convergence of the CQ Method for Fixed Point Process. Nonlinear Analysis, 64, 2400-2411. [Google Scholar] [CrossRef] 

为你推荐