Convergence of string-averaging method for a class of operators

被引:8
作者
Nikazad, T. [1 ,2 ]
Abbasi, M. [3 ]
Mirzapour, M. [1 ]
机构
[1] Iran Univ Sci & Technol, Sch Math, Tehran 1684613114, Iran
[2] Inst Res Fundamental Sci IPM, Sch Math, POB 19395-5746, Tehran, Iran
[3] Univ Qom, Dept Math, Qom 3716146611, Iran
关键词
convex feasibility problems; iterative methods; projection methods; string-averaging; block iteration; CONVEX FEASIBILITY PROBLEMS; PARALLEL SUBGRADIENT PROJECTIONS; ITERATIVE ALGORITHMS; IMAGE-RECONSTRUCTION; SYSTEMS;
D O I
10.1080/10556788.2016.1209500
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We analyse a fixed-point iterative method with a finite pool of operators which are subfamily of strictly quasi-nonexpansive operators. These operators, which are not necessarily continuous, may be employed in iterative methods used in convex feasibility problems. Furthermore, members of this subfamily are able to handle convex constraints. The current iterate of the fixed-point iterative method is made by averaging of strings' endpoints and each string consists of a composition of operators which lie in the pool. To examine the study, we deal with two important pools of operators. The first one is a class of operators which define the algebraic iterative methods, as block iterative projection methods, for solving linear systems of equations (inequalities). The second class consists of the parallel subgradient projection operators for solving nonlinear convex feasibility problems. In both classes, we use optimal relaxation or optimal weight parameters which may break the continuity of the operators used in the classes. The advantages and disadvantages of using these parameters are illustrated using some numerical examples.
引用
收藏
页码:1189 / 1208
页数:20
相关论文
共 37 条
[1]   BLOCK-ITERATIVE PROJECTION METHODS FOR PARALLEL COMPUTATION OF SOLUTIONS TO CONVEX FEASIBILITY PROBLEMS [J].
AHARONI, R ;
CENSOR, Y .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1989, 120 :165-180
[2]  
[Anonymous], 2001, Studies in Computational Mathematics, DOI DOI 10.1016/S1570-579X(01)80010-0
[3]  
[Anonymous], 2013, ITERATIVE METHODS FI
[4]  
[Anonymous], 2001, Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, DOI [DOI 10.1016/S1570-579X(01)80009-4, 10.1016/S1570-579X(01)80009-4]
[5]  
[Anonymous], 1997, Parallel Optimization: Theory, Algorithms, and Applications
[6]   A weak-to-strong convergence principle for Fejer-monotone methods in Hilbert spaces [J].
Bauschke, HH ;
Combettes, PL .
MATHEMATICS OF OPERATIONS RESEARCH, 2001, 26 (02) :248-264
[7]   Projection algorithms for solving convex feasibility problems [J].
Bauschke, HH ;
Borwein, JM .
SIAM REVIEW, 1996, 38 (03) :367-426
[8]   Extrapolation algorithm for affine-convex feasibility problems [J].
Bauschke, HH ;
Combettes, PL ;
Kruk, SG .
NUMERICAL ALGORITHMS, 2006, 41 (03) :239-274
[9]   Stable Convergence Behavior Under Summable Perturbations of a Class of Projection Methods for Convex Feasibility and Optimization Problems [J].
Butnariu, Dan ;
Davidi, Ran ;
Herman, Gabor T. ;
Kazantsev, Ivan G. .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2007, 1 (04) :540-547
[10]   Extrapolation and local acceleration of an iterative process for common fixed point problems [J].
Cegielski, Andrzej ;
Censor, Yair .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2012, 394 (02) :809-818