Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem

作者: Ya-zheng Dang , Yan Gao

DOI: 10.1007/S11766-014-3070-0

关键词:

摘要: This paper deals with a bi-extrapolated subgradient projection algorithm by introducing two extrapolated factors in the iterative step to solve multiple-sets split feasibility problem. The strategy is intend improve convergence. And its convergence proved under some suitable conditions. Numerical results illustrate that converges more quickly than existing algorithms.

参考文章(15)
Patrick L. Combettes, Heinz H. Bauschke, Convex Analysis and Monotone Operator Theory in Hilbert Spaces ,(2011)
Guy Pierra, Eclatement de Contraintes en Parallèle pour la Minimisation d'une Forme Quadratique ifip conference on optimization techniques modeling and optimization in service of man. pp. 200- 218 ,(1975) , 10.1007/3-540-07623-9_288
Qingzhi Yang, The relaxed CQ algorithm solving the split feasibility problem Inverse Problems. ,vol. 20, pp. 1261- 1266 ,(2004) , 10.1088/0266-5611/20/4/014
Yair Censor, Tommy Elfving, A multiprojection algorithm using Bregman projections in a product space Numerical Algorithms. ,vol. 8, pp. 221- 239 ,(1994) , 10.1007/BF02142692
Wenxing Zhang, Deren Han, Zhibao Li, A self-adaptive projection method for solving the multiple-sets split feasibility problem Inverse Problems. ,vol. 25, pp. 115001- ,(2009) , 10.1088/0266-5611/25/11/115001
Heinz H. Bauschke, Jonathan M. Borwein, On Projection Algorithms for Solving Convex Feasibility Problems SIAM Review. ,vol. 38, pp. 367- 426 ,(1996) , 10.1137/S0036144593251710
Yair Censor, Avi Motova, Alexander Segal, Perturbed projections and subgradient projections for the multiple-sets split feasibility problem Journal of Mathematical Analysis and Applications. ,vol. 327, pp. 1244- 1256 ,(2007) , 10.1016/J.JMAA.2006.05.010
A Moudafi, THE SPLIT COMMON FIXED-POINT PROBLEM FOR DEMICONTRACTIVE MAPPINGS Inverse Problems. ,vol. 26, pp. 55007- 55007 ,(2010) , 10.1088/0266-5611/26/5/055007