English

运筹学学报 >

2021 , Vol. 25 >Issue 1: 50 - 60

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2021.01.004

 

强收敛的球松弛CQ算法及其应用

展开
  • 1. 洛阳师范学院数学科学学院, 河南洛阳 471934
    2. 洛阳师范学院, 河南省电子商务大数据处理与分析重点实验室, 河南洛阳 471934
于海 E-mail: yuhai2000@126.com

收稿日期: 2019-06-03

  网络出版日期: 2021-03-05

基金资助

国家自然科学基金(11971216);国家自然科学基金(62072222);河南省高等学校重点科研项目(20A110029)

收起

Strongly convergent ball-relaxed CQ algorithm and its application

Expand
  • 1. School of Mathematical Sciences, Luoyang Normal University, Luoyang 471934, Henan, China
    2. Henan KeyLaboratory for Big Data Processing and Analysis of ElectronicCommerce, Luoyang Normal University, Luoyang 471934, Henan, China

Received date: 2019-06-03

  Online published: 2021-03-05

Fold

摘要

为了求解分裂可行问题，Yu等提出了一个球松弛CQ算法。由于该算法只需计算到闭球上的投影，同时不需要计算有界线性算子的范数，该算法是容易实现的。但是球松弛CQ算法在无穷维Hilbert空间中仅仅具有弱收敛性。首先构造了一个强收敛的球松弛CQ算法。在较弱的条件下，证明了算法的强收敛性。其次将该算法应用到一类闭凸集上的投影问题上。最后，数值试验验证了该算法的有效性。

关键词： 分裂可行问题; CQ算法; 强收敛; 强凸函数

本文引用格式

于海, 詹婉荣 . 强收敛的球松弛CQ算法及其应用[J]. 运筹学学报, 2021 , 25(1) : 50 -60 . DOI: 10.15960/j.cnki.issn.1007-6093.2021.01.004

Abstract

In order to solve the split feasibility problem, Yu et al. proposed a ballrelaxed CQ algorithm. Since this algorithm only needs to calculate the projection on the closed balls and does not need to calculate the norm of bounded linear operator, it is easy to implement. But the ball-relaxed CQ algorithm only has weak convergence in infinite dimensional Hilbert spaces. Firstly, a strongly convergent ball-relaxed CQ algorithm is constructed. Under weaker conditions, the strong convergence of the algorithm is proved. Secondly, the algorithm is applied to the projection problem on a class of closed convex sets. Finally, numerical experiments verify the effectiveness of the algorithm.

Key words： split feasibility problem; CQ algorithm; strongconvergence; strongly convex function

参考文献

1 Censor Y , Elfving T . A multiprojection algorithm using Bregman projections in product space[J]. Numerical Algorithms, 1994, 8, 221- 239.
2 López G , Martín V , Wang F , et al. Solving the split feasibility problem without prior knowledge of matrix norms[J]. Inverse Problems, 2012, 28, 085004.
3 Byrne C . Iterative oblique projection onto convex sets and the split feasibility problem[J]. Inverse Problems, 2002, 18, 441- 453.
4 Byrne C . A unified treatment of some iterative algorithms in signal processing and image reconstruction[J]. Inverse Problems, 2004, 20, 103- 120.
5 Qu B , Xiu N . A note on the CQ algorithm for the split feasibility problem[J]. Inverse Problems, 2005, 21, 1655- 1665.
6 Wang F . On the convergence of CQ algorithm with variable steps for the split equality problem[J]. Numerical Algorithms, 2017, 74, 927- 935.
7 Wang F , Xu H , Su M . Choices of variable steps of the CQ algorithm for the split feasibility problem[J]. Fixed Point Theory, 2011, 12, 489- 496.
8 Yang Q . On variable-step relaxed projection algorithm for variational inequalities[J]. Journal of Mathematical Analysis and Applications, 2005, 302, 166- 179.
9 He S , Zhao Z , Luo B . A relaxed self-adaptive CQ algorithm for the multiple-setes split feasibility problem[J]. Optimization, 2015, 64, 1907- 1918.
10 Moudafi A . A relaxed alternating CQ-algorithm for convex feasibility problems[J]. Nonlinear Analysis, 2013, 79, 117- 121.
11 Qu B , Xiu N . A new halfspace-relaxation projection method for the split feasibility problem[J]. Linear Algebra and its Applications, 2008, 428, 1218- 1229.
12 Wang F . Polyak's gradient method for split feasibility problem constrained by level sets[J]. Numerical Algorithms, 2018, 77, 925- 938.
13 Yang Q . The relaxed CQ algorithm solving the split feasibility problem[J]. Inverse Problems, 2004, 20, 1261- 1266.
14 Yu H , Zhan W , Wang F . The ball-relaxed CQ algorithms for the split feasibility problem[J]. Optimization, 2018, 67 (10): 1687- 1699.
15 Bauschke H , Combettes P . Convex Analysis and Monotone Operator Theory in Hilbert Space[M]. New York: Springer-Verlag, 2011.
16 He S , Tian H . Selective projection methods for solving a class of variational inequalities[J]. Numerical Algorithms, 2019, 80 (2): 617- 634.
17 Xu H . A variable Krasnosel$\rm{\ddot{s}}$kii-Mann algorithm and the multiple-set split feasibility problem[J]. Inverse Problems, 2006, 22 (6): 2021- 2034.
18 Lin A, Han S. Projection on an ellipsoid[R]. Department of Mathematical Sciences, The Johns Hopkins University, 2001.
19 Dai Y . Fast algorithms for projection on an ellipsoid[J]. SIAM Journal on Optimization, 2006, 16 (4): 986- 1006.
Options
文章导航

/

〈 〉