分裂可行问题的一个强收敛算法
A Strongly Convergent Algorithm for the Split Feasibility Problem
DOI: 10.12677/AAM.2020.96101, PDF,    国家自然科学基金支持
作者: 詹婉荣, 于 海：洛阳师范学院数学科学学院，河南 洛阳
关键词: 分裂可行问题；CQ算法；强收敛；投影；Split Feasibility Problem； CQ Algorithm； Strong Convergence； Projection
摘要: 分裂可行问题是一类应用很广泛的最优化问题。经典的CQ算法仅具有弱收敛性。为了得到强收敛性，本文通过改进文献中的算法，构造了一个具有强收敛性的算法。该算法为了避免计算有界线性算子的范数，还采用了变步长策略。并且在较弱的条件下，证明了算法的强收敛性。
Abstract: The split feasibility problem is a kind of widely used optimization problem. The classical CQ algorithm only has weak convergence. In order to obtain strong convergence, this paper constructs an algorithm with strong convergence by improving the algorithms in the literature. In order to avoid calculating the norm of the bounded linear operator, the algorithm also adopts the strategy of variable step size. Under the weaker condition, the strong convergence of the algorithm is proved.
文章引用：詹婉荣, 于海. 分裂可行问题的一个强收敛算法[J]. 应用数学进展, 2020, 9(6): 844-851. https://doi.org/10.12677/AAM.2020.96101

参考文献

[1] Censor, Y. and Elfving, T. (1994) A Multiprojection Algorithm Using Bregman Projections in Product Space. Numerical Algorithms, 8, 221-239. [Google Scholar] [CrossRef] 
[2] Lopez, G., Martin, V., Wang, F. and Xu, H. (2012) Solving the Split Feasibility Problem without Prior Knowledge of Matrix Norms. Inverse Problems, 28, Article ID: 085004. [Google Scholar] [CrossRef] 
[3] Byrne, C. (2002) Iterative Oblique Projection onto Convex Sets and the Split Feasibility Problem. Inverse Problems, 18, 441-453. [Google Scholar] [CrossRef] 
[4] Byrne, C. (2004) A Unified Treatment of Some Iterative Algorithms in Signal Processing and Image Reconstruction. Inverse Problems, 20, 103-120. [Google Scholar] [CrossRef] 
[5] Qu, B. and Xiu, N. (2005) A Note on the CQ Algorithm for the Split Feasibility Problem. Inverse Problems, 21, 1655-1665. [Google Scholar] [CrossRef] 
[6] Wang, F. (2017) On the Convergence of CQ Algorithm with Variable Steps for the Split Equality Problem. Numerical Algorithms, 74, 927-935. [Google Scholar] [CrossRef] 
[7] Wang, F., Xu, H. and Su, M. (2011) Choices of Variable Steps of the CQ Algorithm for the Split Feasibility Problem. Fixed Point Theory, 12, 489-496. [Google Scholar] [CrossRef] 
[8] Yang, Q. (2005) On Variable-Step Relaxed Projection Algorithm for Variational Inequalities. Journal of Mathematical Analysis and Applications, 302, 166-179. [Google Scholar] [CrossRef] 
[9] Yu, H., Zhan, W. and Wang, F. (2018) The Ball-Relaxed CQ Algorithms for the Split Feasibility Problem. Optimization, 67, 1687-1699. [Google Scholar] [CrossRef] 
[10] Xu, H. (2006) A Variable Krasnoselskii-Mann Algorithm and the Multiple-Set Split Feasibility Problem. Inverse Problems, 22, 2021-2034. [Google Scholar] [CrossRef] 
[11] Bauschke, H. and Combettes, P. (2011) Convex Analysis and Monotone Operator Theory in Hilbert Space. Springer-Verlag, New York. [Google Scholar] [CrossRef] 
[12] Xu, H. (2002) Iterative Algorithms for Nonlinear Operators. Journal of the London Mathematical Society, 66, 240-256. [Google Scholar] [CrossRef] 

为你推荐