Linear and strong convergence of algorithms involving averaged…线性和强大的算法收敛涉及平均.pdfVIP

Linear and strong convergence of algorithms involving averaged nonexpansive operators † ‡ Heinz H. Bauschke, Dominikus Noll and Hung M. Phan June 14, 2014 Abstract We introduce regularity notions for averaged nonexpansive operators. Combined with regularity notions of their fixed point sets, we obtain linear and strong convergence results for quasicyclic, cyclic, and random iterations. New convergence results on the Borwein–Tam method (BTM) and on the cylically anchored Douglas– Rachford algorithm (CADRA) are also presented. Finally, we provide a numerical comparison of BTM, CADRA and the classical method of cyclic projections for solv- ing convex feasibility problems. 2010 Mathematics Subject Classification: Primary 65K05; Secondary 47H09, 90C25. Keywords: Averaged nonexpansive mapping, Borwein–Tam method, bounded linear regular- ity, convex feasibility problem, convex set, cyclically anchored Douglas–Rachford algorithm, Douglas–Rachford algorithm, nonexpansive operator, projection, random method, transversality. 1 Overview Throughout this paper, X is a real Hilbert space with inner product , and induced norm . The convex feasibility problem asks to find a point in the intersection of convex Mathematics, University of British Columbia, Kelowna, B.C. V1V 1V7, Canada. E-mail: . † ´ ´ Universite Paul Sabatier, Institut de Mathematiques, 118 route de Narbonne, 31062 Toulouse, France. E-mail: . ‡Mathematics, University of British Columbia, Kelowna, B.C. V1V 1V7, Canada. E-mail: . 1 sets. This is an important problem in mathematics and engineering; see, e.g., [6],