arXiv:1809.04250 [math.OC]AbstractReferencesReviewsResources
On the convergence rate improvement of a splitting method for finding the resolvent of the sum of maximal monotone operators
Published 2018-09-12Version 1
This paper provides a new way of developing the splitting method which is used to solve the problem of finding the resolvent of the sum of maximal monotone operators in Hilbert spaces. By employing accelerated techniques developed by Davis and Yin (in Set-Valued Var. Anal. 25(4):829-858, 2017), this paper presents an implementable, strongly convergent splitting method which is designed to solve the problem. In particular, we show that the distance between the sequence of iterates and the solution converges to zero at a rate O(1/k) to illustrate the efficiency of the proposed method, where k is the number of iterations. Then, we apply the result to a class of optimization problems.
Categories: math.OC
Related articles: Most relevant | Search more
arXiv:1609.01627 [math.OC] (Published 2016-09-06)
Inducing strong convergence into the asymptotic behaviour of proximal splitting algorithms in Hilbert spaces
arXiv:2304.11366 [math.OC] (Published 2023-04-22)
Rates of asymptotic regularity of the Tikhonov-Mann iteration for families of mappings
arXiv:0709.1020 [math.OC] (Published 2007-09-07)
Evolution Strategies in Optimization Problems