Backward-Backward Splitting in Hadamard Spaces
classification
🧮 math.OC
math.MG
keywords
backward-backwardspaceshadamardalgorithmconvergenceconvexerror-tolerantfinding
read the original abstract
The backward-backward algorithm is a tool for finding minima of a regularization of the sum of two convex functions in Hilbert spaces. We generalize this setting to Hadamard spaces and prove the convergence of an error-tolerant version of the backward-backward method.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.