Inducing strong convergence into the asymptotic behaviour of proximal splitting algorithms in Hilbert spaces. (4th May 2019)

• Record Type: Journal Article
• Authors: Boţ, Radu Ioan; Csetnek, Ernö Robert; Meier, Dennis
• Is Part Of: Optimization methods and software. Volume 34:Number 3(2019)
• Page Start: 489
• Page End: 514
• Publication Date: 2019-05-04
• Subjects: fixed points of nonexpansive mappings -- Tikhonov regularization -- splitting methods -- forward–backward algorithm -- Douglas–Rachford algorithm -- primal–dual algorithm; 47J25 -- 47H09 -- 47H05 -- 90C25; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2018.1457151
• Languages: English
• ISSNs: 1055-6788

Abstract

Abstract : Proximal splitting algorithms for monotone inclusions (and convex optimization problems) in Hilbert spaces share the common feature to guarantee for the generated sequences in general weak convergence to a solution. In order to achieve strong convergence, one usually needs to impose more restrictive properties for the involved operators, like strong monotonicity (respectively, strong convexity for optimization problems). In this paper, we propose a modified Krasnosel'skiĭ–Mann algorithm in connection with the determination of a fixed point of a nonexpansive mapping and show strong convergence of the iteratively generated sequence to the minimal norm solution of the problem. Relying on this, we derive a forward–backward and a Douglas–Rachford algorithm, both endowed with Tikhonov regularization terms, which generate iterates that strongly converge to the minimal norm solution of the set of zeros of the sum of two maximally monotone operators. Furthermore, we formulate strong convergent primal–dual algorithms of forward–backward and Douglas–Rachford-type for highly structured monotone inclusion problems involving parallel-sums and compositions with linear operators. The resulting iterative schemes are particularized to the solving of convex minimization problems. The theoretical results are illustrated by numerical experiments on the split feasibility problem in infinite dimensional spaces.